The Kierstead's Conjecture and limitwise monotonic functions

&
Annals of Pure and Applied Logic 169 (6):467-486 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2018.01.003

Links

PhilArchive



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

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

Limitwise monotonic functions, sets, and degrees on computable domains.Asher M. Kach & Daniel Turetsky - 2010 - Journal of Symbolic Logic 75 (1):131-154.
Computable shuffle sums of ordinals.Asher M. Kach - 2008 - Archive for Mathematical Logic 47 (3):211-219.
Limitwise monotonic sets of reals.Marat Faizrahmanov & Iskander Kalimullin - 2015 - Mathematical Logic Quarterly 61 (3):224-229.
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Pavel Semukhin - 2006 - Notre Dame Journal of Formal Logic 47 (1):63-71.
Automorphisms of η-like computable linear orderings and Kierstead's conjecture.Charles M. Harris, Kyung Il Lee & S. Barry Cooper - 2016 - Mathematical Logic Quarterly 62 (6):481-506.
The ultra‐weak Ash conjecture and some particular cases.Annie Chateau & Malika More - 2006 - Mathematical Logic Quarterly 52 (1):4-13.
A Conjecture on Numeral Systems.Karim Nour - 1997 - Notre Dame Journal of Formal Logic 38 (2):270-275.
Η-representation of sets and degrees.Kenneth Harris - 2008 - Journal of Symbolic Logic 73 (4):1097-1121.
A Semantic Approach to Non-Monotonic Conditionals.James Hawthorne - 1988 - In J. F. Lemmer & L. N. Kanal (eds.), Uncertainty in Artificial Intelligence 2. Elsevier.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
Monotonic and Non-monotonic Embeddings of Anselm’s Proof.Jacob Archambault - 2017 - Logica Universalis 11 (1):121-138.
The Woods–Erdös conjecture for polynomial rings.Maxim Vsemirnov - 2001 - Annals of Pure and Applied Logic 113 (1-3):331-344.
Reflecting on the 3x+1 Mystery. Outline of a Scenario - Improbable or Realistic ?Edward G. Belaga - manuscript
Some remarks on Schanuel's conjecture.Ricardo Bianconi - 2001 - Annals of Pure and Applied Logic 108 (1-3):15-18.
Properties of Saturation in Monotonic Neighbourhood Models and Some Applications.Sergio A. Celani - 2015 - Studia Logica 103 (4):733-755.

Analytics

Added to PP
2018-01-15

Downloads
10 (#1,118,334)

6 months
1 (#1,428,112)

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

Increasing η ‐representable degrees.Andrey N. Frolov & Maxim V. Zubkov - 2009 - Mathematical Logic Quarterly 55 (6):633-636.
On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders.Rodney G. Downey & Michael F. Moses - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):237-246.
On Π 1-automorphisms of recursive linear orders.Henry A. Kierstead - 1987 - Journal of Symbolic Logic 52 (3):681-688.

View all 7 references / Add more references