Switch to: References

Add citations

You must login to add citations.
  1. Hilbert's program then and now.Richard Zach - 2006 - In Dale Jacquette (ed.), Philosophy of Logic. North Holland. pp. 411–447.
    Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Gödel’s second incompleteness theorem for Σn-definable theories.Conden Chao & Payam Seraji - 2018 - Logic Journal of the IGPL 26 (2):255-257.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Meeting on Neutral Ground. A Reflection on Man-Machine Contests.Albert Visser - 2020 - Studia Semiotyczne 34 (1):279-294.
    We argue that thinking of the man-machine comparison in terms of a contest involves, in a reasonable scenario, a criterion of success that is neutral. This is because we want to avoid a petitio principii. We submit, however, that, by looking at things this way, one makes the most essential human things invisible. Thus, in a sense, the contest approach is self-defeating.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
    Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Self-reference and incompleteness in a non-monotonic setting.Timothy G. Mccarthy - 1994 - Journal of Philosophical Logic 23 (4):423 - 449.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Gödel's Third Incompleteness Theorem.Timothy McCarthy - 2016 - Dialectica 70 (1):87-112.
    In a note appended to the translation of “On consistency and completeness” (), Gödel reexamined the problem of the unprovability of consistency. Gödel here focuses on an alternative means of expressing the consistency of a formal system, in terms of what would now be called a ‘reflection principle’, roughly, the assertion that a formula of a certain class is provable in the system only if it is true. Gödel suggests that it is this alternative means of expressing consistency that we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Experimental Logics, Mechanism and Knowable Consistency.Martin Kaså - 2012 - Theoria 78 (3):213-224.
    In a paper published in 1975, Robert Jeroslow introduced the concept of an experimental logic as a generalization of ordinary formal systems such that theoremhood is a (or in practice ) rather than . These systems can be viewed as (rather crude) representations of axiomatic theories evolving stepwise over time. Similar ideas can be found in papers by Putnam (1965) and McCarthy and Shapiro (1987). The topic of the present article is a discussion of a suggestion by Allen Hazen, that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Logic for Trial and Error Classifiers.Martin Kaså - 2015 - Journal of Logic, Language and Information 24 (3):307-322.
    Trial and error classifiers, corresponding to concepts which change their extensions over time, are introduced and briefly philosophically motivated. A fragment of the language of classical first-order logic is given a new semantics, using \-sequences of classical models, in order to interpret the basic predicates as classifiers of this kind. It turns out that we can use a natural deduction proof system which differs from classical logic only in the conditions for application of existential elimination. Soundness and completeness theorems are (...)
    Download  
     
    Export citation  
     
    Bookmark