Register | Log in | FAQ      [?] 

Tag proof_theory [44 articles]

Recent papers classified by the tag proof_theory.
  • Hypersequent Calculi for Gödel Logics - a Survey
    Journal of Logic and Computation, Vol. 13, No. 6. (December 2003), pp. 835-861.
    by Baaz Matthias, Ciabattoni Agata, G Fermuller
    posted to godel hypersequents logic proof_theory sequent_calculus by rzach on 2005-03-15 03:37:34 as *** along with 2 people and 1 group greg_restall htowsner LogicPhilMath
  • Comparing the Complexity of Cut-Elimination Methods
    Proof Theory in Computer Science: International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings (2001), 49.
    by Matthias Baaz, Alexander Leitsch
    posted to proof_theory by rzach on 2007-10-09 00:56:07 as ***** along with 1 person yoriyuki
  • Cut-Elimination for Simple Type Theory with an Axiom of Choice
    The Journal of Symbolic Logic, Vol. 64, No. 2. (1999), pp. 479-485.
    by G Mints
    posted to epsilon proof_theory sequent_calculus type_theory by rzach on 2007-10-08 19:39:11 as ****
  • Hilbert's 'Verunglückter Beweis', the first epsilon theorem, and consistency proofs
    History and Philosophy of Logic, Vol. 25 (2004), pp. 79-94.
    by Richard Zach
    posted to epsilon foundations hilbert history history_of_logic mathematics philosophy_of_mathematics proof_theory by rzach on 2005-03-14 15:37:52 as read along with 1 person and 3 groups A_Olympia Philosophy_of_Information Blog_and_Wiki_Research LogicPhilMath
  • What's so special about Kruskal's theorem and the ordinal [Gamma]o? A survey of some results in proof theory
    Annals of Pure and Applied Logic, Vol. 53, No. 3. (19 September 1991), pp. 199-260.
    by Gallier
    posted to proof_theory by rzach on 2006-12-25 17:56:23 as read along with 1 group LogicPhilMath
  • Hilbert's $ε$-Terms in Automated Theorem Proving
    Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX´99, Saratoga Springs, NY, USA, June 1999. Proceedings (1999), pp. 662-662.
    by Martin Giese, Wolfgang Ahrendt
    posted to epsilon proof_theory tableaux by rzach on 2007-10-08 19:35:15 as read
  • Resolution and the Origins of Structural Reasoning: Early Proof-Theoretic Ideas of Hertz and Gentzen
    The Bulletin of Symbolic Logic, Vol. 8, No. 2. (2002), pp. 246-265.
    by Peter Schroeder-Heister
    posted to history_of_logic proof_theory sequent_calculus by rzach on 2005-03-16 18:02:58 as read along with 2 people and 3 groups A_Olympia greg_restall Philosophy_of_Information Blog_and_Wiki_Research LogicPhilMath
  • Uniform Proof Complexity
    Journal of Logic and Computation, Vol. 15, No. 4. (August 2005), pp. 433-446.
    by Arnold Beckmann
    posted to proof_theory by rzach on 2005-08-07 22:32:08 as ** along with 1 person and 1 group johannsen LogicPhilMath
  • Forcing in Proof Theory
    The Bulletin of Symbolic Logic, Vol. 10, No. 3. (2004), pp. 305-333.
    by Jeremy Avigad
    posted to forcing proof_theory by rzach on 2005-03-14 17:36:27 as ** along with 1 person and 1 group greg_restall LogicPhilMath
  • Generalizing theorems in real closed fields
    Annals of Pure and Applied Logic, Vol. 75, No. 1-2. (12 September 1995), pp. 3-23.
    by Matthias Baaz, Richard Zach
    posted to generalization_of_proofs kreisel proof_theory by rzach on 2005-03-16 17:59:12 as read along with 1 group LogicPhilMath
  • Completeness of a first-order temporal logic with time-gaps
    Theoretical Computer Science, Vol. 160, No. 1-2. (10 June 1996), pp. 241-270.
    by Matthias Baaz, Alexander Leitsch, Richard Zach
    posted to logic proof_theory resolution temporal_logic by rzach on 2005-03-16 17:57:22 as read along with 1 group LogicPhilMath
  • A proof-theoretical investigation of global intuitionistic (fuzzy) logic
    Archive for Mathematical Logic, Vol. 44, No. 4. (May 2005), pp. 435-457.
    by Agata Ciabattoni
    posted to godel_logic hypersequents logic proof_theory by rzach on 2005-05-07 03:08:51 as ** along with 1 group LogicPhilMath
  • Epsilon substitution for transfinite induction
    Archive for Mathematical Logic, Vol. 44, No. 4. (May 2005), pp. 397-412.
    by Henry Towsner
    posted to epsilon proof_theory by rzach on 2005-05-07 03:07:25 as *** along with 1 group LogicPhilMath
  • Transfinite Progressions: A Second Look at Completeness
    The Bulletin of Symbolic Logic, Vol. 10, No. 3. (2004), pp. 367-389.
    by Torkel Franzen
    posted to progressions proof_theory by rzach on 2005-03-16 07:10:26 as *** along with 1 group LogicPhilMath
  • Heyting predicate calculus with epsilon symbol
    Journal of Mathematical Sciences, Vol. 8, No. 3. (1977), pp. 317-323.
    by GE Mints
    posted to epsilon proof_theory by rzach on 2007-10-10 00:40:54 as **
  • Identity of Proofs Based on Normalization and Generality
    The Bulletin of Symbolic Logic, Vol. 9, No. 4. (2003), pp. 477-503.
    by Kosta Dosen
    posted to normalization proof_theory by rzach on 2005-03-16 07:07:48 as ** along with 2 people and 1 group yoriyuki greg_restall LogicPhilMath
  • An ordinal analysis of stability
    Archive for Mathematical Logic, Vol. 44, No. 1. (January 2005), pp. 1-62.
    by Michael Rathjen
    posted to foundations proof_theory by rzach on 2005-06-09 17:59:20 as ** along with 1 person and 1 group htowsner LogicPhilMath
  • Choice in Dynamic Linking
    Foundations of Software Science and Computation Structures (2004), pp. 12-26.
    by Martín Abadi, Georges Gonthier, Benjamin Werner
    posted to epsilon natural_deduction proof_theory by rzach on 2007-10-08 20:02:28 as **
  • An ordinal analysis of parameter free Π<sup>1</sup><sub>2</sub>-comprehension
    Archive for Mathematical Logic, Vol. 44, No. 3. (April 2005), pp. 263-362.
    by Michael Rathjen
    posted to foundations proof_theory by rzach on 2005-06-09 17:57:06 as ** along with 1 person and 1 group htowsner LogicPhilMath
  • Cut elimination for the second order propositional logic with Hilbert's ε-symbol, extensionality, and full comprehension
    Logical Foundations of Computer Science (1997), pp. 113-118.
    by Michael Gavrilovich
    posted to epsilon proof_theory sequent_calculus by rzach on 2007-10-08 20:01:15 as ****
  • Cut elimination in $ε$-calculi
    Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, Vol. 28, No. 20-21. (1982), pp. 311-316.
    by Mitsuru Yasuhara
    posted to epsilon proof_theory sequent_calculus by rzach on 2007-10-08 19:22:20 as read
  • An addition to “Cut Elimination in $ε$-calculi”
    Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, Vol. 35, No. 6. (1989), pp. 483-484.
    by Mitsuru Yasuhara
    posted to epsilon proof_theory sequent_calculus by rzach on 2007-10-08 19:21:51 as read
  • Cut elimination in a Gentzen-style $ε$-calculus without identity
    Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, Vol. 23, No. 36. (1977), pp. 527-538.
    by Linda Wessels
    posted to epsilon proof_theory sequent_calculus by rzach on 2007-10-08 19:21:19 as read
  • Logic and Meaning: The Philosophical Significance of the Sequent Calculus
    by Michael Kremer
    posted to gentzen philosophy_of_logic proof_theory sequent_calculus by rzach on 2005-11-21 13:52:43 as *** along with 1 person and 1 group greg_restall LogicPhilMath
  • Normal derivability in classical logic
    The Syntax and Semantics of Infinitary Languages (1968), pp. 204-236.
    by W Tait
    posted to proof_theory sequent_calculus by rzach on 2007-10-09 07:14:11 as read
  • Introduction to Cirquent Calculus and Abstract Resource Semantics
    (27 Jun 2005)
    by Giorgi Japaridze
    posted to calculus cirquent computability logic proof_theory by jonjonc on 2005-07-17 03:40:00 as ** along with 1 person Lewis
  • CHR: A Constructive Relevant Natural-deduction Logic
    Electronic Notes in Theoretical Computer Science, Vol. 91 (16 February 2004), pp. 158-170.
    by Neil Leslie, Edwin D Mares
    posted to constructive_logic natural_deduction proof_theory relevant_logic by CLLC on 2006-03-27 11:59:34 as read
  • On $n$-quantifier induction
    J. Symbolic Logic, Vol. 37 (1972), pp. 466-482.
    by Charles Parsons
    posted to proof_theory _file _dipl _copy arithmetic by adrian_pigors on 2008-04-30 09:42:59 as read
  • Fragments of arithmetic
    Ann. Pure Appl. Logic, Vol. 28, No. 1. (1985), pp. 33-71.
    by Wilfried Sieg
    posted to proof_theory pra _dipl _copy arithmetic by adrian_pigors on 2008-04-30 09:37:26 as read
  • PRA provability of Schmerl's fine structure theorem
    Rend. Sem. Mat. Univ. Politec. Torino, Vol. 42, No. 2. (1984), pp. 87-106 (1985).
    by Franco Parlamento
    posted to reflection provability proof_theory pra _dipl _copy by adrian_pigors on 2008-04-29 10:21:57 as read
  • Interpretability in reflexive theories---a survey
    Theoria, Vol. 63, No. 3. (1997), pp. 182-209.
    by Per Lindström
    posted to self-reference provability proof_theory logic interpretability _dipl _copy consistency by adrian_pigors on 2008-04-29 10:48:27 as read
  • A fine structure generated by reflection formulas over primitive recursive arithmetic
    Vol. 97 (1979), pp. 335-350.
    by Ulf R Schmerl
    posted to reflection provability proof_theory pra _dipl _copy by adrian_pigors on 2008-04-29 10:15:13 as read
  • Displaying and deciding substructural logics. I. Logics with contraposition
    J. Philos. Logic, Vol. 27, No. 2. (1998), pp. 179-216.
    by Greg Restall
    posted to substructural_logics proof_theory frame _file display_logic by adrian_pigors on 2008-07-02 10:21:03 as **
  • Display logic and gaggle theory
    Rep. Math. Logic, No. 29. (1995), pp. 133-146 (1996).
    by Greg Restall
    posted to substructural_logics proof_theory gaggle frame _file display_logic _copy by adrian_pigors on 2008-07-02 09:50:29 as ***
  • Gaggles, Gentzen and Galois: how to display your favourite substructural logic
    Log. J. IGPL, Vol. 6, No. 5. (1998), pp. 669-694.
    by Rajeev Goré
    posted to substructural_logics proof_theory galois_connection gaggle _file display_logic _copy by adrian_pigors on 2008-07-02 10:50:35 as ****
  • Proof-theoretic methods in nonclassical logic---an introduction
    Vol. 2 (1998), pp. 207-254.
    by Hiroakira Ono
    posted to _copy cut_elimination _file logic proof_theory substructural_logics by adrian_pigors on 2007-12-13 09:54:38 as ***
  • Interpretability of various extensions of arithmetic
    Mathematical Notes, Vol. 40, No. 5. (1 November 1986), pp. 821-827.
    by SV Goryachev
    posted to reflection proof_theory interpretability _file _dipl _copy consistency arithmetic by adrian_pigors on 2008-04-30 10:00:19 as read
  • Reflection using the derivability conditions
    Vol. 180 (1996), pp. 603-616.
    by Sean Matthews, Alex K Simpson
    posted to reflection proof_theory _file _copy arithmetic by adrian_pigors on 2008-04-29 10:39:08 as read
  • Reflection principles and their use for establishing the complexity of axiomatic systems
    Z. Math. Logik Grundlagen Math., Vol. 14 (1968), pp. 97-142.
    by G Kreisel, A Lévy
    posted to reflection proof_theory _file _dipl _copy consistency by adrian_pigors on 2008-04-29 10:32:17 as read
  • An Introduction to Substructural Logics
    (01 February 2000)
    by Greg Restall
    posted to _bib frame kripke logic proof_theory semantics substructural_logics by adrian_pigors on 2007-09-20 12:49:51 as *****
  • Ordinal arithmetic in $ IΔ\sb 0$
    Vol. 23 (1993), pp. 320-363.
    by Richard Sommer
    posted to proof_theory ordinal _dipl _copy arithmetic by adrian_pigors on 2008-04-30 09:52:07 as read
  • Logics for termination and correctness of functional programs. II. Logics of strength PRA
    (1992), pp. 195-225.
    by Solomon Feferman
    posted to _copy pra proof_theory by adrian_pigors on 2008-02-22 12:01:24 as **
  • On the no-counterexample interpretation
    J. Symbolic Logic, Vol. 64, No. 4. (1999), pp. 1491-1511.
    by Ulrich Kohlenbach
    posted to _copy _file proof_theory by adrian_pigors on 2008-02-22 12:21:59 as **
  • On a number theoretic choice schema and its relation to induction
    (1970), pp. 459-473.
    by Charles Parsons
    posted to proof_theory _dipl _copy arithmetic by adrian_pigors on 2008-04-30 09:48:32 as read
    • Note: You may cite this page as: http://www.citeulike.org/tag/proof_theory

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.