- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
This paper is about the semantic analysis of referentially opaque verbs like seek and owe that give rise to nonspecific readings. It is argued that Montague's categorization (based on earlier work by Quine) of opaque verbs as properties of quantifiers runs into two serious difficulties: the first problem is that it does not work with opaque verbs like resemble that resist any lexical decomposition of the seek ap try to find kind; the second one is that it wrongly predicts de (...) |
|
|
Though deceptively simple and plausible on the face of it, Craig's interpolation theorem (published 50 years ago) has proved to be a central logical property that has been used to reveal a deep harmony between the syntax and semantics of first order logic. Craig's theorem was generalized soon after by Lyndon, with application to the characterization of first order properties preserved under homomorphism. After retracing the early history, this article is mainly devoted to a survey of subsequent generalizations and applications, (...) |
|
|
In his Doppelvortrag, Edmund Husserl introduced two concepts of “definiteness” which have been interpreted as a vindication of his role in the history of completeness. Some commentators defended that the meaning of these notions should be understood as categoricity, while other scholars believed that it is closer to syntactic completeness. A detailed study of the early twentieth-century axiomatics and Husserl’s Doppelvortrag shows, however, that many concepts of completeness were conflated as equivalent. Although “absolute definiteness” was principally an attempt to characterize (...) |
|
|
|
|
|
We discuss three problems concerning the use of formal languages in theoretical physics: (i) the definability of time and spacetime in classical physical theories; (ii) how to cope with indistinguishable elementary particles in quantum mechanics without labeling them; and (iii) how to get a formal picture of quantum states jumping. |
|
|
It is easy to show that in many natural axiomatic formulations of physical and even mathematical theories, there are many superfluous concepts usually assumed as primitive. This happens mainly when these theories are formulated in the language of standard set theories, such as Zermelo–Fraenkel’s. In 1925, John von Neumann created a set theory where sets are definable by means of functions. We provide a reformulation of von Neumann’s set theory and show that it can be used to formulate physical and (...) |
|
|
Though deceptively simple and plausible on the face of it, Craig's interpolation theorem has proved to be a central logical property that has been used to reveal a deep harmony between the syntax and semantics of first order logic. Craig's theorem was generalized soon after by Lyndon, with application to the characterization of first order properties preserved under homomorphism. After retracing the early history, this article is mainly devoted to a survey of subsequent generalizations and applications, especially of many-sorted interpolation (...) |
|
|
Bertrand Russell’s 1906 article ‘The Theory of Implication’ contains an algebraic weak completeness proof for classical propositional logic. Russell did not present it as such. We give an exposition of the proof and investigate Russell’s view of what he was about, whether he could have appreciated the proof for what it is, and why there is no parallel of the proof in Principia Mathematica. |
|
|
|
|
|
We investigate expressiveness and definability issues with respect to minimal models, particularly in the scope of Circumscription. First, we give a proof of the failure of the Löwenheim-Skolem Theorem for Circumscription. Then we show that, if the class of P; Z-minimal models of a first-order sentence is Δ-elementary, then it is elementary. That is, whenever the circumscription of a first-order sentence is equivalent to a first-order theory, then it is equivalent to a finitely axiomatizable one. This means that classes of (...) |
|
|
The paper surveys different notions of implicit definition. In particular, we offer an examination of a kind of definition commonly used in formal axiomatics, which in general terms is understood as providing a definition of the primitive terminology of an axiomatic theory. We argue that such “structural definitions” can be semantically understood in two different ways, namely as specifications of the meaning of the primitive terms of a theory and as definitions of higher-order mathematical concepts or structures. We analyze these (...) |
|
|
We use Padoa's principle of independence of primitive symbols in axiomatic systems in order to show that time is dispensable in continuum thermodynamics, according to the axiomatic formulation of Gurtin and Williams. We also show how to define time by means of the remaining primitive concepts of Gurtin and Williams system. Finally, we introduce thermodynamics without time as a primitive concept. |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-9b866bbb8-jltg9 uwo