End extensions of models of fragments of PA (original) (raw)

On end extensions of models of subsystems of peano arithmetic

Costas Dimitrakopoulos

Theoretical Computer Science, 2001

View PDFchevron_right

Internal End-Extensions of Peano Arithmetic and a Problem of Gaifman

Larry Manevitz

Journal of the London Mathematical Society, 1976

View PDFchevron_right

Models and types of Peano's arithmetic

Haim Gaifman

Annals of Mathematical Logic, 1976

View PDFchevron_right

Submodels and definable points in models of Peano arithmetic

Zarko Mijajlovic

Notre Dame Journal of Formal Logic, 1983

View PDFchevron_right

A standard model of Peano arithmetic with no conservative elementary extension

Ali Enayat

Annals of Pure and Applied Logic, 2008

View PDFchevron_right

Completeness theorems, incompleteness theorems and models of arithmetic

Ken McAloon

Transactions of the American Mathematical Society, 1978

View PDFchevron_right

Theories of initial segments of standard models of arithmetics and their complete extensions

Konrad Zdanowski, Jerzy Tomasik

Theoretical Computer Science, 2011

View PDFchevron_right

Existentially Closed Models in the Framework of Arithmetic

Zofia Adamowicz

Journal of Symbolic Logic, 2016

View PDFchevron_right

Iterations of Satisfaction Classes and Models of Peano Arithmetic

Roman Murawski

Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1992

View PDFchevron_right

A Note on BΣn and an Intermediate Induction Schema

Zofia Adamowicz

Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1988

View PDFchevron_right

A Note on Induction Schemas in Bounded Arithmetic

Aleksandar Ignjatovic

Arxiv preprint cs/0210011, 2002

View PDFchevron_right

Overspill and fragments of arithmetic

Costas Dimitrakopoulos

Archive for Mathematical Logic, 1989

View PDFchevron_right

Provability logic: models within models in Peano Arithmetic

Alessandro Berarducci

Bollettino dell'Unione Matematica Italiana

View PDFchevron_right

Models of PT − with internal induction for total formulae

Bartosz Wcisło

View PDFchevron_right

Majorizing provably recursive functions in fragments of PA

Andrea Cantini

Archiv für Mathematische Logik und Grundlagenforschung, 1985

View PDFchevron_right

On a Hierarchy of Reflection Principles in Peano Arithmetic

Elena Nogina

View PDFchevron_right

14 On a Hierarchy of Reflection Principles in Peano Arithmetic

Elena Nogina

2016

View PDFchevron_right

Some consequences of interpreting the associated logic of the rst-order Peano Arithmetic PA nitarily

Bhupinder Singh Anand

arXiv (Cornell University), 2012

View PDFchevron_right

A proof of the (strengthened) Liar formula in a semantical extension of Peano Arithmetic

Jeffrey Ketland

Analysis, 2000

View PDFchevron_right

Automorphisms of models of arithmetic: A unified view

Ali Enayat

Annals of Pure and Applied Logic, 2007

View PDFchevron_right

Some consequences of interpreting the associated logic of thefirst-order Peano Arithmetic PA finitarily

Bhupinder Singh Anand

2011

View PDFchevron_right

Reflection Principles in Fragments of Peano Arithmetic

Hiroakira Ono

Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 1987

View PDFchevron_right

Some consequences of interpreting the associated logic of a first-order Peano Arithmetic PA finitarily

Bhupinder Singh Anand

View PDFchevron_right

Kaye Richard. Models of Peano arithmetic. Oxford logic guides, no. 15. Clarendon Press, Oxford University Press, Oxford and New York 1991, x + 292 pp

Costas Dimitrakopoulos

Journal of Symbolic Logic, 1993

View PDFchevron_right

Substructure lattices of models of arithmetic

George Mills

Annals of Mathematical Logic, 1979

View PDFchevron_right

Degrees of insolubility of extensions of arithmetic by true propositions

Oleg Okunev

Russian Mathematical Surveys, 1988

View PDFchevron_right

Shepherdson's theorems for fragments of open induction

Jana Glivická

arXiv (Cornell University), 2017

View PDFchevron_right

Notes on bounded induction for the compositional truth predicate

Bartosz Wcisło

View PDFchevron_right

On the induction schema for decidable predicates

Lev Beklemishev

The Journal of Symbolic Logic, 2003

View PDFchevron_right

On the Hierarchy of Intuitionistic Bounded Arithmetic

Morteza Moniri

Journal of Logic and Computation, 2007

View PDFchevron_right

Fragments of arithmetic

Wilfried Sieg

Annals of Pure and Applied Logic, 1985

View PDFchevron_right

Existentially Closed Models and Conservation Results in Bounded Arithmetic

Andrés Covelo Franco

Journal of Logic and Computation, 2009

View PDFchevron_right

PA is instantiationally and arithmetically complete, but algorithmically incomplete An interpretation of Gödelian incompleteness under Church's Thesis that leads to a link between formal logic and computability

Bhupinder Singh Anand

View PDFchevron_right

An induction principle for consequence in arithmetic universes

Maria Maietti

Journal of Pure and Applied Algebra, 2012

View PDFchevron_right