Generalizing proofs in monadic languages

&
Annals of Pure and Applied Logic 154 (2):71-138 (2008)
  Copy   BIBTEX

Abstract

This paper develops a proof theory for logical forms of proofs in the case of monadic languages. Among the consequences are different kinds of generalization of proofs in various schematic proof systems. The results use suitable relations between logical properties of partial proof data and algebraic properties of corresponding sets of linear diophantine equations

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2007.10.010

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Linearizing intuitionistic implication.Patrick Lincoln, Andre Scedrov & Natarajan Shankar - 1993 - Annals of Pure and Applied Logic 60 (2):151-177.
Structural Proof Theory.Sara Negri, Jan von Plato & Aarne Ranta - 2001 - New York: Cambridge University Press. Edited by Jan Von Plato.
Uniform proofs as a foundation for logic programming.Dale Miller, Gopalan Nadathur, Frank Pfenning & Andre Scedrov - 1991 - Annals of Pure and Applied Logic 51 (1-2):125-157.
Provability logics with quantifiers on proofs.Rostislav E. Yavorsky - 2001 - Annals of Pure and Applied Logic 113 (1-3):373-387.
On automating diagrammatic proofs of arithmetic arguments.Mateja Jamnik, Alan Bundy & Ian Green - 1999 - Journal of Logic, Language and Information 8 (3):297-321.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
Polarized and focalized linear and classical proofs.Olivier Laurent, Myriam Quatrini & Lorenzo Tortora de Falco - 2005 - Annals of Pure and Applied Logic 134 (2):217-264.
Non-commutative proof construction: a constraint-based approach.Jean-Marc Andreoli, Roberto Maieli & Paul Ruet - 2006 - Annals of Pure and Applied Logic 142 (1):212-244.
Resolution over linear equations and multilinear proofs.Ran Raz & Iddo Tzameret - 2008 - Annals of Pure and Applied Logic 155 (3):194-224.
Interpolants, cut elimination and flow graphs for the propositional calculus.Alessandra Carbone - 1997 - Annals of Pure and Applied Logic 83 (3):249-299.

Analytics

Added to PP
2013-12-26

Downloads
45 (#549,249)

6 months
10 (#383,177)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Matthias Baaz
TU Wien

Citations of this work

No citations found.

Add more citations

References found in this work

One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
Foundations of mathematics for the working mathematician.N. Bourbaki - 1949 - Journal of Symbolic Logic 14 (1):1-8.
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.

View all 13 references / Add more references