Switch to: References

Add citations

You must login to add citations.
  1. Descriptions in Mathematical Logic.Gerard R. Renardel - 1984 - Studia Logica 43 (3):281-294.
    After a discussion of the different treatments in the literature of vacuous descriptions, the notion of descriptor is slightly generalized to function descriptor Ⅎ $\overset \rightarrow \to{y}$, so as to form partial functions φ = Ⅎ $y.A$ which satisfy $\forall \overset \rightarrow \to{x}z\leftrightarrow y=z))$. We use logic with existence predicate, as introduced by D. S. Scott, to handle partial functions, and prove that adding function descriptors to a theory based on such a logic is conservative. For theories with quantification over (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the syntax of logic and set theory.Lucius T. Schoenbaum - 2010 - Review of Symbolic Logic 3 (4):568-599.
    We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the Bernays postulates for quantifiers and the comprehension schemata of ZF and other set theories. We prove that it is consistent in any finite Boolean subset lattice. We investigate the antinomies of Russell, Cantor, Burali-Forti, and others, and discuss the relationship of the system to other set-theoretic (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  • What are sets and what are they for?Alex Oliver & Timothy Smiley - 2006 - Philosophical Perspectives 20 (1):123–155.
  • Even dialetheists should hate contradictions.Edwin D. Mares - 2000 - Australasian Journal of Philosophy 78 (4):503 – 516.
  • Some Observations on the Axiom of Choice.Arthur H. Kruse - 1962 - Mathematical Logic Quarterly 8 (2):125-146.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Some Observations on the Axiom of Choice.Arthur H. Kruse - 1962 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (2):125-146.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Constructive Methods of Numeration.Arthur H. Kruse - 1962 - Mathematical Logic Quarterly 8 (1):57-70.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Constructive Methods of Numeration.Arthur H. Kruse - 1962 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (1):57-70.
  • Philosophy, mathematics, science and computation.Enrique V. Kortright - 1994 - Topoi 13 (1):51-60.
    Attempts to lay a foundation for the sciences based on modern mathematics are questioned. In particular, it is not clear that computer science should be based on set-theoretic mathematics. Set-theoretic mathematics has difficulties with its own foundations, making it reasonable to explore alternative foundations for the sciences. The role of computation within an alternative framework may prove to be of great potential in establishing a direction for the new field of computer science.Whitehead''s theory of reality is re-examined as a foundation (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The semantics of categorical sentences.Gordon Matheson - 1967 - Australasian Journal of Philosophy 45 (3):309-320.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Set‐Theories as Algebras.Paul Fjelstad - 1968 - Mathematical Logic Quarterly 14 (25-29):383-411.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Causal Slingshots.Michael Baumgartner - 2010 - Erkenntnis 72 (1):111-133.
    Causal slingshots are formal arguments advanced by proponents of an event ontology of token-level causation which, in the end, are intended to show two things: (i) The logical form of statements expressing causal dependencies on token level features a binary predicate ‘‘... causes ...’’ and (ii) that predicate takes events as arguments. Even though formalisms are only revealing with respect to the logical form of natural language statements, if the latter are shown to be adequately captured within a corresponding formalism, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Importance of Developing a Foundation for Naive Category Theory.Marcoen J. T. F. Cabbolet - 2015 - Thought: A Journal of Philosophy 4 (4):237-242.
    Recently Feferman has outlined a program for the development of a foundation for naive category theory. While Ernst has shown that the resulting axiomatic system is still inconsistent, the purpose of this note is to show that nevertheless some foundation has to be developed before naive category theory can replace axiomatic set theory as a foundational theory for mathematics. It is argued that in naive category theory currently a ‘cookbook recipe’ is used for constructing categories, and it is explicitly shown (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • A completeness theorem for “theories of kind W”.Stephen L. Bloom - 1971 - Studia Logica 27 (1):43-55.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Shallow Analysis and the Slingshot Argument.Michael Baumgartner - 2010 - Journal of Philosophical Logic 39 (5):531-556.
    According to the standard opinions in the literature, blocking the unacceptable consequences of the notorious slingshot argument requires imposing constraints on the metaphysics of facts or on theories of definite descriptions (or class abstracts). This paper argues that both of these well-known strategies to rebut the slingshot overshoot the mark. The slingshot, first and foremost, raises the question as to the adequate logical formalization of statements about facts, i.e. of factual contexts. It will be shown that a rigorous application of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations