Online research in philosophy

Machine generated contents note: Part I. Historical Context - Gödel's Contributions and Accomplishments: 1. The impact of Gödel's incompleteness theorems on mathematics Angus Macintyre; 2. Logical hygiene, foundations, and abstractions: diversity among aspects and options Georg Kreisel; 3. The reception of Gödel's 1931 incompletabilty theorems by mathematicians, and some logicians, to the early 1960s Ivor Grattan-Guinness; 4. 'Dozent Gödel will not lecture' Karl Sigmund; 5. Gödel's thesis: an appreciation Juliette C. Kennedy; 6. Lieber Herr Bernays!, Lieber Herr Gödel! Gödel on (...) finitism, constructivity, and Hilbert's program Solomon Feferman; 7. Computation and intractability: echoes of Kurt Gödel Christos H. Papadimitriou; 8. From the entscheidungsproblem to the personal computer - and beyond B. Jack Copeland; 9. Gödel, Einstein, Mach, Gamow, and Lanczos: Gödel's remarkable excursion into cosmology Wolfgang Rindler; 10. Physical unknowables Karl Svozil; Part II. A Wider Vision - The Interdisciplinary, Philosophical, And Theological Implications of Gödel's Work: 11. Gödel and physics John D. Barrow; 12. Gödel, Thomas Aquinas, and the unknowability of God Denys A. Turner; 13. Gödel's mathematics of philosophy Piergiorgio Odifreddi; 14. Gödel's ontological proof and its variants Petr Hájek; 15. The Gödel theorem and human nature Hilary Putnam; 16. Gödel, the mind, and the laws of physics Roger Penrose; Part III. New Frontiers - Beyond Gödel's Work in Mathematics and Symbolic Logic: 17. Gödel's functional interpretation and its use in current mathematics Ulrich Kohlenbach; 18. My forty years on his shoulders Harvey M. Friedman; 19. My interaction with Kurt Gödel: the man and his work Paul J. Cohen; 20. The transfinite universe W. Hugh Woodin; 21. The Gödel phenomena in mathematics: a modern view Avi Wigderson. (shrink)

We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite-valued logic if the labels are interpreted as sets of truth values (sets-as-signs). Furthermore, it is shown that any finite-valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the number (...) of truth values, and it is shown that this bound is tight. (shrink)

We construct a faithful interpretation of ukasiewicz's logic in product logic (both propositional and predicate). Using known facts it follows that the product predicate logic is not recursively axiomatizable.We prove a completeness theorem for product logic extended by a unary connective of Baaz [1]. We show that Gödel's logic is a sublogic of this extended product logic.