Switch to: References

Add citations

You must login to add citations.
  1. Nonstandard theories of quantification and identity.A. Trew - 1970 - Journal of Symbolic Logic 35 (2):267-294.
  • Spring Meeting of the Association for Symbolic Logic.Penelope Maddy - 1992 - Journal of Symbolic Logic 57 (1):366-371.
  • On the philosophical foundations of free logic.Karel Lambert - 1981 - Inquiry: An Interdisciplinary Journal of Philosophy 24 (2):147 – 203.
    The essay outlines the character of free logic, and motivation for its construction and development. It details some technical achievements of high philosophical interest, but urges that the role of existence assumptions in logic is still not fully understood, that unresolved old problems, both technical and philosophical, abound, and presents some new problems of considerable philosophical import in free logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Incomplete Symbols — Definite Descriptions Revisited.Norbert Gratzl - 2015 - Journal of Philosophical Logic 44 (5):489-506.
    We investigate incomplete symbols, i.e. definite descriptions with scope-operators. Russell famously introduced definite descriptions by contextual definitions; in this article definite descriptions are introduced by rules in a specific calculus that is very well suited for proof-theoretic investigations. That is to say, the phrase ‘incomplete symbols’ is formally interpreted as to the existence of an elimination procedure. The last section offers semantical tools for interpreting the phrase ‘no meaning in isolation’ in a formal way.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A definition of truth for theories with intensional definite description operators.Richard E. Grandy - 1972 - Journal of Philosophical Logic 1 (2):137--155.
  • Definedness.Solomon Feferman - 1995 - Erkenntnis 43 (3):295 - 320.
    Questions of definedness are ubiquitous in mathematics. Informally, these involve reasoning about expressions which may or may not have a value. This paper surveys work on logics in which such reasoning can be carried out directly, especially in computational contexts. It begins with a general logic of partial terms, continues with partial combinatory and lambda calculi, and concludes with an expressively rich theory of partial functions and polymorphic types, where termination of functional programs can be established in a natural way.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   19 citations