An Institution-Independent Proof of the Robinson Consistency Theorem

&
Studia Logica 85 (1):41-73 (2007)
  Copy   BIBTEX

Abstract

We prove an institutional version of A. Robinson ’s Consistency Theorem. This result is then appliedto the institution of many-sorted first-order predicate logic and to two of its variations, infinitary and partial, obtaining very general syntactic criteria sufficient for a signature square in order to satisfy the Robinson consistency and Craig interpolation properties

Categories

Keywords

Reprint years

DOI

10.1007/s11225-007-9022-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

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

An institution-independent proof of Craig interpolation theorem.Răzvan Diaconescu - 2004 - Studia Logica 77 (1):59 - 79.
The consistency of arithmetic.Storrs McCall - manuscript
An Institution-independent Proof of the Beth Definability Theorem.M. Aiguier & F. Barbier - 2007 - Studia Logica 85 (3):333-359.
An extended joint consistency theorem for a nonconstructive logic of partial terms with definite descriptions.Raymond D. Gumb - 2001 - Studia Logica 69 (2):279-292.
The Consistency of Probabilistic Regresses: Some Implications for Epistemological Infinitism. [REVIEW]Frederik Herzberg - 2013 - Erkenntnis 78 (2):371-382.
Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, Institutionally.Daniel Găină - 2014 - Logica Universalis 8 (3-4):469-498.
Geometry of Robinson consistency in Łukasiewicz logic.Manuela Busaniche & Daniele Mundici - 2007 - Annals of Pure and Applied Logic 147 (1):1-22.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
The road to two theorems of logic.William Craig - 2008 - Synthese 164 (3):333 - 339.
Consistency statements and iterations of computable functions in IΣ1 and PRA.Joost J. Joosten - 2010 - Archive for Mathematical Logic 49 (7-8):773-798.
Applications of Many‐Sorted Robinson Consistency Theorem.Daniele Mundici - 1981 - Mathematical Logic Quarterly 27 (11‐12):181-188.
A simplified proof of an impossibility theorem.Alfred F. Mackay - 1973 - Philosophy of Science 40 (2):175-177.
Gleason's theorem has a constructive proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
Applications of Many‐Sorted Robinson Consistency Theorem.Daniele Mundici - 1981 - Mathematical Logic Quarterly 27 (11-12):181-188.
Tait's conservative extension theorem revisited.Ryota Akiyoshi - 2010 - Journal of Symbolic Logic 75 (1):155-167.

Analytics

Added to PP
2009-01-28

Downloads
57 (#276,529)

6 months
9 (#294,961)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrei Popescu
Politehnica University of Bucharest

Citations of this work

Abstract Beth Definability in Institutions.Marius Petria & Răzvan Diaconescu - 2006 - Journal of Symbolic Logic 71 (3):1002 - 1028.
Abstract Categorical Logic.Marc Aiguier & Isabelle Bloch - 2023 - Logica Universalis 17 (1):23-67.
Saturated models in institutions.Răzvan Diaconescu & Marius Petria - 2010 - Archive for Mathematical Logic 49 (6):693-723.

View all 6 citations / Add more citations

References found in this work

Linear reasoning. A new form of the herbrand-Gentzen theorem.William Craig - 1957 - Journal of Symbolic Logic 22 (3):250-268.
[Omnibus Review].H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (2):342-344.
Model Theory.Gebhard Fuhrken - 1976 - Journal of Symbolic Logic 41 (3):697-699.

View all 7 references / Add more references