Sequence encoding without induction

Mathematical Logic Quarterly 58 (3):244-248 (2012)
  Copy   BIBTEX

Abstract

We show that the universally axiomatized, induction-free theory equation image is a sequential theory in the sense of Pudlák's 5, in contrast to the closely related Robinson's arithmetic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

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

Recantation or any old w-sequence would do after all.Paul Benacerraf - 1996 - Philosophia Mathematica 4 (2):184-189.
Expressive Logics for Coalgebras via Terminal Sequence Induction.Dirk Pattinson - 2004 - Notre Dame Journal of Formal Logic 45 (1):19-33.
The Backward Induction Argument.John W. Carroll - 2000 - Theory and Decision 48 (1):61-84.
Some problems of counter‐inductive policy as opposed to inductive.Audun Öfsti - 1962 - Inquiry: An Interdisciplinary Journal of Philosophy 5 (1-4):267-283.
No Need to Justify Induction Generally.Kazuyoshi Kamiyama - 2008 - Proceedings of the Xxii World Congress of Philosophy 53:105-111.

Analytics

Added to PP
2013-10-31

Downloads
21 (#743,384)

6 months
3 (#984,719)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

The small‐is‐very‐small principle.Albert Visser - 2019 - Mathematical Logic Quarterly 65 (4):453-478.
The arithmetic of the even and the odd.Victor Pambuccian - 2016 - Review of Symbolic Logic 9 (2):359-369.
Cofinal elementary extensions.James H. Schmerl - 2014 - Mathematical Logic Quarterly 60 (1-2):12-20.

Add more citations

References found in this work

Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.
Pairs, sets and sequences in first-order theories.Albert Visser - 2008 - Archive for Mathematical Logic 47 (4):299-326.
Axiomatizability by a schema.Robert L. Vaught - 1967 - Journal of Symbolic Logic 32 (4):473-479.

Add more references