Structural proof theory

Results: 38



#Item
1Mathematics / Theoretical computer science / Theory of computation / Structural complexity theory / Computability theory / Halting problem / Mathematical proof / Undecidable problem / Negation / Reductio ad absurdum / Reduction / Square root of 2

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary

Add to Reading List

Source URL: philosopher-animal.com

Language: English - Date: 2007-04-18 22:48:16
2Mathematical proofs / Lemmas / Five lemma / Homological algebra / Structural induction / Theorem / Proof assistant

Hipster: Integrating Theory Exploration in a Proof Assistant Moa Johansson, Dan Ros´en, Nicholas Smallbone, and Koen Claessen Department of Computer Science and Engineering, Chalmers University of Technology {jomoa,danr

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2014-05-05 03:54:39
3Mathematical logic / Theoretical computer science / Mathematics / Automated theorem proving / Logic in computer science / Model theory / First-order logic / Mathematical proof / Unification / Equality

Extending Superposition with Integer Arithmetic, Structural Induction, and Beyond Simon Cruanes École polytechnique and Inria https://who.rocq.inria.fr/Simon.Cruanes/

Add to Reading List

Source URL: cedeela.fr

Language: English - Date: 2015-09-09 10:21:01
4

Purity through Unravelling Robert Hein and Charles Stewart Technische Universit¨ at Dresden, Germany Abstract. We divide attempts to give the structural proof theory of

Add to Reading List

Source URL: www.textproof.com

Language: English - Date: 2011-09-23 03:34:03
    5Cut-elimination theorem / Sequent / Rule of inference / First-order logic / Formal proof / Natural deduction / Structural proof theory / Logic / Proof theory / Mathematical logic

    An Abstract Completion Procedure for Cut Elimination in Deduction Modulo Guillaume Burel École Normale Supérieure de Lyon & LORIA∗ The complementarity and interaction between computation

    Add to Reading List

    Source URL: www.ensiie.fr

    Language: English - Date: 2015-01-06 05:11:00
    6Complexity classes / Proof theory / Structural complexity theory / Curry–Howard correspondence / Type theory / NP / Time complexity / Reduction / Linear logic / Theoretical computer science / Computational complexity theory / Applied mathematics

    On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL)

    Add to Reading List

    Source URL: www.cs.swan.ac.uk

    Language: English - Date: 2015-05-05 07:12:16
    7Mathematics / Sequent calculus / Intuitionistic logic / Cut-elimination theorem / Interpretation / Sequent / Structural rule / Propositional calculus / Linear logic / Logic / Mathematical logic / Proof theory

    June 22, 2009 — Final version for the proceedings of CSL’09 Expanding the realm of systematic proof theory Agata Ciabattoni1 , Lutz Straßburger2 , and Kazushige Terui3 1

    Add to Reading List

    Source URL: www.lix.polytechnique.fr

    Language: English - Date: 2009-06-23 06:51:18
    8Non-classical logic / Boolean algebra / Propositional calculus / Substructural logic / Linear logic / Structural rule / Modal logic / Cut-elimination theorem / Negation / Logic / Mathematical logic / Proof theory

    AG8 SUBATOMIC LOGIC Alessio Guglielmi (TU Dresdenupdated on

    Add to Reading List

    Source URL: cs.bath.ac.uk

    Language: English - Date: 2007-12-18 10:38:04
    9Mathematics / Sequent calculus / Intuitionistic logic / Cut-elimination theorem / Interpretation / Sequent / Structural rule / Propositional calculus / Linear logic / Logic / Mathematical logic / Proof theory

    June 22, 2009 — Final version for the proceedings of CSL’09 Expanding the realm of systematic proof theory Agata Ciabattoni1 , Lutz Straßburger2 , and Kazushige Terui3 1

    Add to Reading List

    Source URL: www.lix.polytechnique.fr

    Language: English - Date: 2009-06-23 06:51:18
    10Structural complexity theory / Complexity classes / Models of computation / Lance Fortnow / Probabilistic complexity theory / Interactive proof system / IP / Bounded-error probabilistic polynomial / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics

    Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

    Add to Reading List

    Source URL: people.cs.uchicago.edu

    Language: English - Date: 2010-05-13 09:33:41
    UPDATE