Search for consequences

Abstract

NOTE: This is an edited version of my lecture at LC ‘06. It differs from my earlier lecture at the Gödel Centenary in Vienna, April 29, 2006 most notably in section 5, where “Finite Graph Theory” is replaced by “Order Calculus”.

Categories

Add categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

A Deterministic Terminating Sequent Calculus For Gödel-dummett Logic.R. Dyckhoff - 1999 - Logic Journal of the IGPL 7 (3):319-326.
Brandom and Hume on the genealogy of modals.Huw Price - manuscript
Axioms for determinateness and truth.Solomon Feferman - 2008 - Review of Symbolic Logic 1 (2):204-217.
Ramsey theory and enormous lower Bounds.Harvey Friedman - manuscript
Finite and algorithmic model theory, edited by Javier Esparza, Christian Michaux, and Charles Steinhorn, London Mathematical Society Lecture Note Series. Cambridge University Press, 2011, 356 pp. [REVIEW]Michael Benedikt - 2013 - Bulletin of Symbolic Logic 19 (1):112-115.
Strict reverse mathematics draft.Harvey M. Friedman - unknown
Useless, Useful Theoretical Philosophy.Panu Raatikainen - manuscript
A Note on Gödel-Dummet Logic LC.Gemma Robles & José M. Méndez - 2021 - Bulletin of the Section of Logic 50 (3):325-335.
Wilfried Buchholz. Notation systems for infinitary derivations. Archive for mathematical logic, vol. 30 no. 5–6 (1991), pp. 277–296. - Wilfried Buchholz. Explaining Gentzen's consistency proof within infinitary proof theory. Computational logic and proof theory, 5th Kurt Gödel colloquium, KGC '97, Vienna, Austria, August 25–29, 1997, Proceedings, edited by Georg Gottlob, Alexander Leitsch, and Daniele Mundici, Lecture notes in computer science, vol. 1289, Springer, Berlin, Heidelberg, New York, etc., 1997, pp. 4–17. - Sergei Tupailo. Finitary reductions for local predicativity, I: recursively regular ordinals. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Háajek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., etc., 2000, pp. 465–499. [REVIEW]Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
Completeness of a Hypersequent Calculus for Some First-order Gödel Logics with Delta.Matthias Baaz, Norbert Preining & Richard Zach - 2006 - In Baaz Matthias, Preining Norbert & Zach Richard (eds.), 36th Interna- tional Symposium on Multiple-valued Logic. May 2006, Singapore. Proceedings. IEEE Press.

Analytics

Added to PP
2009-01-28

Downloads
53 (#414,465)

6 months
53 (#98,680)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references