A Set of Metrics for Measuring Interestingness of Theorems in Automated Theorem Finding by Forward Reasoning: A Case Study in NBG Set Theory

Author(s):  
Hongbiao Gao ◽  
Yuichi Goto ◽  
Jingde Cheng
Keyword(s):  
Author(s):  
Nikos Pelekis ◽  
Babis Theodoulidis ◽  
Ioannis Kopanakis ◽  
Yannis Theodoridis

QOSP Quality of Service Open Shortest Path First based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services in the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision-making. This paper focuses on routing algorithms and their appli-cations for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory offers a knowledge discovery approach to extracting routing-decisions from attribute set. The extracted rules can then be used to select significant routing-attributes and make routing-selections in routers. A case study is conducted to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algorithm based on data mining and rough set offers a promising approach to the attribute-selection prob-lem in internet routing.


2011 ◽  
Vol 17 (3) ◽  
pp. 337-360 ◽  
Author(s):  
Tatiana Arrigoni

AbstractWhat counts as an intuitively plausible set theoretic content (notion, axiom or theorem) has been a matter of much debate in contemporary philosophy of mathematics. In this paper I develop a critical appraisal of the issue. I analyze first R. B. Jensen's positions on the epistemic status of the axiom of constructibility. I then formulate and discuss a view of intuitiveness in set theory that assumes it to hinge basically on mathematical success. At the same time, I present accounts of set theoretic axioms and theorems formulated in non-strictly mathematical terms, e.g., by appealing to the iterative concept of set and/or to overall methodological principles, like unify and maximize, and investigate the relation of the latter to success in mathematics.


1995 ◽  
Vol 2 (37) ◽  
Author(s):  
Sten Agerholm ◽  
Mike Gordon

Most general purpose proof assistants support versions of<br />typed higher order logic. Experience has shown that these logics are capable<br />of representing most of the mathematical models needed in Computer<br />Science. However, perhaps there exist applications where ZF-style<br />set theory is more natural, or even necessary. Examples may include<br />Scott's classical inverse-limit construction of a model of the untyped lambda-calculus<br /> (D_inf) and the semantics of parts of the Z specification notation.<br /><br />This paper compares the representation and use of ZF set theory within<br />both HOL and Isabelle. The main case study is the construction of D_inf.<br />The advantages and disadvantages of higher-order set theory versus first-order<br />set theory are explored experimentally. This study also provides a<br />comparison of the proof infrastructure of HOL and Isabelle.


Author(s):  
Y. Zeng ◽  
A. Pardasani ◽  
H. Antunes ◽  
Z. Li ◽  
J. Dickinson ◽  
...  

This paper aims to establish a theoretical foundation for representing and interpreting free-hand design sketches throughout the conceptual design process. Both experimental and theoretical approaches are used. In using the experimental approach, one case study from a book and one case study from an automobile assembly system manufacturer are used to illustrate the characteristics of design sketches. These characteristics provide the requirements for models of sketch representation and interpretation. In using the theoretical approach, a mathematical structure of design sketches is established. This mathematical structure can naturally and logically model the evolving sketches generated in the design process, through integrating the strengths of set theory and mereology. Based on the results of these two approaches, a design sketch language is developed to be a formal foundation of sketch representation and interpretation.


Author(s):  
Ivo Lazar ◽  
Said Krayem ◽  
Denisa Hrušecká

What we have solved: the possibility to receive DVB-T (Digital Video Broadcasting Terrestrial) with respect to local conditions for signal. We have deduced: variables that represent a set of so-called useful signal, i.e. the signal suitable for further processing – amplification and distribution. As a case study we have choosed few examples using Event B Method to show possibilty of solving komplex projects by this method. The resulting program can be proven to be correct as for its theoretical backgrounds. It is based on Zermelo-Fraenkel set theory with axion of choice, the concept of generalized substitution and structuring mechanismus (machine, refinement, implementation). B methods are accompanied by mathematical proofs that justify them. Abstract machine in this example connected with mathematical modelling solves an ability to receive DVB-T signal from the plurality of signals, both useful and useless for further processing.


Sign in / Sign up

Export Citation Format

Share Document