论文信息 - On End-Extensions of Models of ¬exp

On End-Extensions of Models of ¬exp

Every model of IΔ0 is the tally part of a model of the stringlanguage theory Th-FO (a main feature of which consists in having induction on notation restricted to certain AC0. sets). We show how to “smoothly” introduce in Th-FO the binary length function, whereby it is possible to make exponential assumptions in models of Th-FO. These considerations entail that every model of IΔ0 + ¬exp is a proper initial segment of a model of Th-FO and that a modicum of bounded collection is true in these models. Mathematics Subject Classification: 03F30, 03C62, 68Q15.

Fernando Ferreira | Fernando Ferreira

[1] Petr Hájek,et al. Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.

[2] Jeff B. Paris,et al. On the scheme of induction for bounded arithmetic formulas , 1987, Ann. Pure Appl. Log..

[3] Fernando Ferreira. Binary models generated by their tally part , 1994, Arch. Math. Log..

[4] George Wilmers,et al. Models OF Peano Arithmetic (Oxford Logic Guides 15) , 1993 .

[5] Jan Krajícek. Exponentiation and Second-Order Bounded Arithmetic , 1990, Ann. Pure Appl. Log..

[6] Jeff B. Paris,et al. On the Existence of end Extensions of Models of Bounded Induction , 1989 .

[7] P. Clote,et al. First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes , 1995 .

[8] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[9] Richard Kaye. Models of Peano arithmetic , 1991, Oxford logic guides.

[10] Stephen G. Simpson,et al. Polynomial time computable arithmetic and conservative extensions , 1988 .

[11] J. Håstad. Computational limitations of small-depth circuits , 1987 .

[12] Fernando Ferreira. Some notes on subword quantification and induction thereof , 2017 .

[13] Neil Immerman,et al. Descriptive and Computational Complexity , 1989, FCT.