- 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.
|
|
|
Never shall this be proved, that things that are not are. ParmenidesTo say that something does not exist, or that there is something which is not, is clearly a contradiction in terms; hence “ ” must be true. Moreover, we should certainly expect leave to put any primitive name of our language for the “x” of any matrix “ … x … ”, and to infer the resulting singular statement from “ ”; it is difficult to contemplate any alternative logical (...) |
|
|
IPC, the intuitionistic predicate calculus, has the property(i) Vc(A c /x) xA.Furthermore, for certain important , IPC has the converse property (ii) xA Vc(A c /x). (i) may be given up in various ways, corresponding to different philosophic intuitions and yielding different systems of intuitionistic free logic. The present paper proves the strong completeness of several of these with respect to Kripke style semantics. It also shows that giving up (i) need not force us to abandon the analogue of (ii). |
|
|
|
|
|
This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with a (...) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
This paper expands on the theory of event structures put forward in previous work by further investigating the subtle connections between time and events. Specifically, in the first part we generalize the notion of an event structure to that of a refinement structure, where various degrees of temporal granularity are accommodated. In the second part we investigate how these structures can account for the context-dependence of temporal structures in natural language semantics. |
|
|
|
|
|
|
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-659b74868d-9pr2t uwo