On Interpretability of Almost Linear Orderings

&
Notre Dame Journal of Formal Logic 39 (3):325-331 (1998)
  Copy   BIBTEX

Abstract

In this paper we define the notion of -linearity for and discuss interpretability (and noninterpretability) of -linear orders in structures and theories

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1039182249

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

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

Interpretability of Robinson arithmetic in the ramified second-order theory of dense linear order.A. P. Hazen - 1991 - Notre Dame Journal of Formal Logic 33 (1):101-111.
Provability and Interpretability Logics with Restricted Realizations.Thomas F. Icard & Joost J. Joosten - 2012 - Notre Dame Journal of Formal Logic 53 (2):133-154.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
Unary interpretability logic.Maarten de Rijke - 1992 - Notre Dame Journal of Formal Logic 33 (2):249-272.
The Closed Fragment of the Interpretability Logic of PRA with a Constant for $\mathrm{I}\Sigma_1$.Joost J. Joosten - 2005 - Notre Dame Journal of Formal Logic 46 (2):127-146.
On the proofs of arithmetical completeness for interpretability logic.Domenico Zambella - 1992 - Notre Dame Journal of Formal Logic 33 (4):542-551.
On certain lattices of degrees of interpretability.Per Lindström - 1984 - Notre Dame Journal of Formal Logic 25 (2):127-140.
On the interpretability of arithmetic in set theory.George E. Collins & J. D. Halpern - 1970 - Notre Dame Journal of Formal Logic 11 (4):477-483.
Countably categorical coloured linear orders.Feresiano Mwesigye & John K. Truss - 2010 - Mathematical Logic Quarterly 56 (2):159-163.
The Marker–Steinhorn Theorem via Definable Linear Orders.Erik Walsberg - 2019 - Notre Dame Journal of Formal Logic 60 (4):701-706.

Analytics

Added to PP
2010-08-24

Downloads
24 (#897,825)

6 months
3 (#1,465,011)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On Theories Having Three Countable Models.Koichiro Ikeda, Akito Tsuboi & Anand Pillay - 1998 - Mathematical Logic Quarterly 44 (2):161-166.

Add more references