531 |
The standard interpretation of higher-order variables in modern logic and the concept of function in mathematicsConstant, Dimitri 22 January 2016 (has links)
A logic that utilizes higher-order quantification --quantifying over concepts (or relations), not just over the first-order level of individuals-- can be interpreted standardly or nonstandardly depending on whether one takes an intensional or extensional view of concepts. I argue that this decision is connected to how one understands the mathematical notion of function. A function is often understood as a rule that, when given an argument from a set of objects called a "domain," returns a value from a set of objects called a "codomain." Because a concept can be thought of as a two-valued function (that indicates whether or not a given object falls under the concept), having an extensional interpretation of higher-order variables --the standard interpretation-- requires that one adopt an extensional notion of function. Viewed extensionally, however, a function is understood not as a rule but rather as a correlation associating every element in a domain with an element in a codomain. When the domain is finite, the two understandings of function are equivalent (since one can define a rule for any finite correlation), but with an infinite domain, the latter understanding admits arbitrary functions, or correlations not definable by a finitely specifiable rule.
Rejection of the standard interpretation is often motivated by the same reasons used to resist the extensional understanding of function. Such resistance is overt in the pronouncements of Leopold Kronecker, but is also implicit in the work of Gottlob Frege, who used an intensional notion of function in his logic. Looking at the problem historically, I argue that the extensional notion of function has been basic to mathematics since ancient times. Moreover, I claim that Gottfried Wilhelm Leibniz's combination of mathematical and metaphysical ideas helped inaugurate an extensional and ultimately model-theoretical approach to mathematical concepts that led to some of the most important applications of mathematics to science (e.g. the use of non-Euclidean geometry in the theory of general relativity). In logic, Frege's use of an intensional notion of function led to contradiction, while Richard Dedekind and Georg Cantor applied the extensional notion of function to develop mathematically revolutionary theories of the transfinite. / 2025-10-15
|
532 |
On formally undecidable propositions of Zermelo-Fraenkel set theorySt. John, Gavin 30 May 2013 (has links)
No description available.
|
533 |
ND, a rule-based implementation of natural deduction : design of the theorem-prover and tutoring systemDongier, François January 1988 (has links)
No description available.
|
534 |
The Logiphro Dilemma: An Examination of the Relationship between God and LogicMcGlothlin, James C. 24 June 2014 (has links)
No description available.
|
535 |
Initial Embeddings in the Surreal Number TreeKaplan, Elliot 23 April 2015 (has links)
No description available.
|
536 |
Reconstruction results for first-order theoriesHan, Jesse January 2018 (has links)
In this thesis, we study problems related to the reconstruction (up to bi-interpretability) of first-order theories from various functorial invariants: automorphism groups, endomorphism monoids, (categories of) countable models, and (ultra)categories of models. / Thesis / Master of Science (MSc)
|
537 |
Efficient implementation of an exact multiple-output boolean function minimization algorithmDueñas, César A. January 1989 (has links)
The performance of the Svoboda-Nadler-Vora algorithm for exact multiple-output boolean function minimization is studied and compared with a heuristic minimization method.
For this purpose, the algorithm has been implemented in optimized ANSI C code. This implementation introduces a new set of procedures to reduce the cost of prime implicant generation. The concept of weight as the number of 1 and don't care neighbors of a state is used to take advantage of the special cases when a state has only one neighbor or no neighbors at all. The cost of prime implicant generation is further reduced by using the fact that the input dependency of any given state is limited by which of its neighbors exist within an output that are 1 's or don't cares. A detailed example illustrates how the heuristic method can fail to find the absolute minimum of a boolean function. / M.S.
|
538 |
Towards a constraint-based multi-agent approach to complex applicationsIndrakumar, Selvaratnam January 2000 (has links)
No description available.
|
539 |
Data type proofs using Edinburgh LCFMonahan, Brian Quentin January 1984 (has links)
No description available.
|
540 |
Hypothetical reasoning in scientific discovery contexts : a preliminary cognitive science-motivated analysisCosta Leite, Manuel da January 1993 (has links)
No description available.
|
Page generated in 0.0331 seconds