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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

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

Through your library

Similar books and articles

Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
Leibniz and Monadic Domination.Shane Duarte - 2013 - Oxford Studies in Early Modern Philosophy 6:209-48.
Topological complexity of locally finite ω-languages.Olivier Finkel - 2008 - Archive for Mathematical Logic 47 (6):625-651.
Generalizing theorems in real closed fields.Matthias Baaz & Richard Zach - 1995 - Annals of Pure and Applied Logic 75 (1-2):3-23.

Analytics

Added to PP
2013-12-26

Downloads
24 (#563,024)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

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