Switch to: References

Add citations

You must login to add citations.
  1. First order logic with empty structures.Mohamed A. Amer - 1989 - Studia Logica 48 (2):169 - 177.
    For first order languages with no individual constants, empty structures and truth values (for sentences) in them are defined. The first order theories of the empty structures and of all structures (the empty ones included) are axiomatized with modus ponens as the only rule of inference. Compactness is proved and decidability is discussed. Furthermore, some well known theorems of model theory are reconsidered under this new situation. Finally, a word is said on other approaches to the whole problem.
    Download  
     
    Export citation  
     
    Bookmark  
  • Models as Universes.Brice Halimi - 2017 - Notre Dame Journal of Formal Logic 58 (1):47-78.
    Kreisel’s set-theoretic problem is the problem as to whether any logical consequence of ZFC is ensured to be true. Kreisel and Boolos both proposed an answer, taking truth to mean truth in the background set-theoretic universe. This article advocates another answer, which lies at the level of models of set theory, so that truth remains the usual semantic notion. The article is divided into three parts. It first analyzes Kreisel’s set-theoretic problem and proposes one way in which any model of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Editorial introduction.Volker Halbach - 2001 - Studia Logica 68 (1):3-20.
    I survey some important semantical and axiomatic theories of self-referential truth. Kripke's fixed-point theory, the revision theory of truth and appraoches involving fuzzy logic are the main examples of semantical theories. I look at axiomatic theories devised by Cantini, Feferman, Freidman and Sheard. Finally some applications of the theory of self-referential truth are considered.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.
    This article bears on four topics: observational predicates and phenomenal properties, vagueness, strict finitism as a philosophy of mathematics, and the analysis of feasible computability. It is argued that reactions to strict finitism point towards a semantics for vague predicates in the form of nonstandard models of weak arithmetical theories of the sort originally introduced to characterize the notion of feasibility as understood in computational complexity theory. The approach described eschews the use of nonclassical logic and related devices like degrees (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A Dilemma in the Philosophy of Set Theory.Ralf-Dieter Schindler - 1994 - Notre Dame Journal of Formal Logic 35 (3):458-463.
    We show that the following conjecture about the universe V of all sets is wrong: for all set-theoretical (i.e., first order) schemata true in V there is a transitive set "reflecting" in such a way that the second order statement corresponding to is true in . More generally, we indicate the ontological commitments of any theory that exploits reflection principles in order to yield large cardinals. The disappointing conclusion will be that our only apparently good arguments for the existence of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Prädikative Klassen.Ralf-Dieter Schindler - 1993 - Erkenntnis 39 (2):209 - 241.
    We consider certain predicative classes with respect to their bearing on set theory, namely on its semantics, and on its ontological power. On the one hand, our predicative classes will turn out to be perfectly suited for establishing a nice hierarchy of metalanguages starting from the usual set theoretical language. On the other hand, these classes will be seen to be fairly inappropriate for the formulation of strong principles of infinity. The motivation for considering this very type of classes is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Conservative theories of classical truth.Volker Halbach - 1999 - Studia Logica 62 (3):353-370.
    Some axiomatic theories of truth and related subsystems of second-order arithmetic are surveyed and shown to be conservative over their respective base theory. In particular, it is shown by purely finitistically means that the theory PA ÷ "there is a satisfaction class" and the theory FS of [2] are conservative over PA.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Tolerance and metalanguages in carnap'slogical syntax of language.David Devidi & Graham Solomon - 1995 - Synthese 103 (1):123 - 139.
    Michael Friedman has recently argued that Carnap'sLogical Syntax of Language is fundamentally flawed in a way that reveals the ultimate failure of logical positivism. Friedman's argument depends crucially on two claims: (1) that Carnap was committed to the view that there is a universal metalanguage and (2) that given what Carnap wanted from a metalanguage, in particular given that he wanted a definition of analytic for an object language, he was in fact committed to a hierarchy of stronger and stronger (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations