- Multidimensional Concepts and Disparate Scale Types.Brian Hedden & Jacob M. Nebel - forthcoming - Philosophical Review.details
|
|
Approximating trees as coloured linear orders and complete axiomatisations of some classes of trees.Ruaan Kellerman & Valentin Goranko - 2021 - Journal of Symbolic Logic 86 (3):1035-1065.details
|
|
All Worlds in One: Reassessing the Forest-Armstrong Argument.Phillip Bricker - 2020 - In Modal Matters: Essays in Metaphysics. Oxford, England: Oxford University Press. pp. 278-314.details
|
|
(1 other version)Linear structures, causal sets and topology.Laurenz Hudetz - 2015 - Studies in the History and Philosophy of Modern Physics.details
|
|
(1 other version)Automata Presenting Structures: A Survey of the Finite String Case.Sasha Rubin, Werner DePauli-Schimanovich, T. U. Wien & Kurt Gödel-Ein Mathematischer Mythos - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.details
|
|
Model theory of the regularity and reflection schemes.Ali Enayat & Shahram Mohsenipour - 2008 - Archive for Mathematical Logic 47 (5):447-464.details
|
|
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.details
|
|
On Cohesive Powers of Linear Orders.Rumen Dimitrov, Valentina Harizanov, Andrey Morozov, Paul Shafer, Alexandra A. Soskova & Stefan V. Vatev - 2023 - Journal of Symbolic Logic 88 (3):947-1004.details
|
|
Amenable equivalence relations and Turing degrees.Alexander S. Kechris - 1991 - Journal of Symbolic Logic 56 (1):182-194.details
|
|
First-order Gödel logics.Richard Zach, Matthias Baaz & Norbert Preining - 2007 - Annals of Pure and Applied Logic 147 (1):23-47.details
|
|
An introduction to theories without the independence property.Hans Adler - unknowndetails
|
|
Non-forking frames in abstract elementary classes.Adi Jarden & Saharon Shelah - 2013 - Annals of Pure and Applied Logic 164 (3):135-191.details
|
|
The full binary tree cannot be interpreted in a chain.Alexander Rabinovich - 2010 - Journal of Symbolic Logic 75 (4):1489-1498.details
|
|
(1 other version)Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.details
|
|
Boolean Algebras, Stone Spaces, and the Iterated Turing Jump.Carl G. Jockusch & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (4):1121 - 1138.details
|
|
Vaught's conjecture for o-minimal theories.Laura L. Mayer - 1988 - Journal of Symbolic Logic 53 (1):146-159.details
|
|
(2 other versions)Modèles saturés et modèles engendrés Par Des indiscernables.Benoît Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.details
|
|
Every recursive linear ordering has a copy in dtime-space (n, log(n)).Serge Grigorieff - 1990 - Journal of Symbolic Logic 55 (1):260-276.details
|
|
Online, computable and punctual structure theory.Matthew Askes & Rod Downey - 2023 - Logic Journal of the IGPL 31 (6):1251-1293.details
|
|
(1 other version)Order Types of Models of Fragments of Peano Arithmetic.Lorenzo Galeotti & Benedikt Löwe - 2022 - Bulletin of Symbolic Logic 28 (2):182-206.details
|
|
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.details
|
|
(1 other version)Effective extensions of partial orders.Dev Kumar Roy - 1990 - Mathematical Logic Quarterly 36 (3):233-236.details
|
|
Nonisomorphism of lattices of recursively enumerable sets.John Todd Hammond - 1993 - Journal of Symbolic Logic 58 (4):1177-1188.details
|
|
Degrees bounding principles and universal instances in reverse mathematics.Ludovic Patey - 2015 - Annals of Pure and Applied Logic 166 (11):1165-1185.details
|
|
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.details
|
|
Degrees coded in jumps of orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.details
|
|
Almost galois ω-stable classes.John T. Baldwin, Paul B. Larson & Saharon Shelah - 2015 - Journal of Symbolic Logic 80 (3):763-784.details
|
|
On countable chains having decidable monadic theory.Alexis Bés & Alexander Rabinovich - 2012 - Journal of Symbolic Logic 77 (2):593-608.details
|
|
(1 other version)The -spectrum of a linear order.Russell Miller - 2001 - Journal of Symbolic Logic 66 (2):470-486.details
|
|
In the Beginning was Game Semantics?Giorgi Japaridze - 2009 - In Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.), Games: Unifying Logic, Language, and Philosophy. Dordrecht, Netherland: Springer Verlag. pp. 249--350.details
|
|
Posets of copies of countable scattered linear orders.Miloš S. Kurilić - 2014 - Annals of Pure and Applied Logic 165 (3):895-912.details
|
|
Sharp Vaught's conjecture for some classes of partial orders.Miloš S. Kurilić - 2024 - Annals of Pure and Applied Logic 175 (4):103411.details
|
|
Weak Well Orders and Fraïssé’s Conjecture.Anton Freund & Davide Manca - forthcoming - Journal of Symbolic Logic:1-16.details
|
|
The Simplest Low Linear Order with No Computable Copies.Andrey Frolov & Maxim Zubkov - 2024 - Journal of Symbolic Logic 89 (1):97-111.details
|
|
Decidable discrete linear orders.M. Moses - 1988 - Journal of Symbolic Logic 53 (2):531-539.details
|
|
Relationships between computability-theoretic properties of problems.Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey & Dan Turetsky - 2022 - Journal of Symbolic Logic 87 (1):47-71.details
|
|
(1 other version)Order Types of Models of Fragments of Peano Arithmetic.Lorenzo Galeotti & Benedikt Löwe - 2022 - Bulletin of Symbolic Logic 28 (2):182-206.details
|
|
Simple types in discretely ordered structures.Dejan Ilić - 2014 - Archive for Mathematical Logic 53 (7-8):929-947.details
|
|
(1 other version)Synthesis for Temporal Logic over the Reals.Tim French, John McCabe-Dansted & Mark Reynolds - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 217-238.details
|
|
The problem of determinacy of infinite games from an intuitionistic point of view.Wim Veldman - 2009 - In Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.), Games: Unifying Logic, Language, and Philosophy. Dordrecht, Netherland: Springer Verlag. pp. 351--370.details
|
|
Equivalence between Fraïssé’s conjecture and Jullien’s theorem.Antonio Montalbán - 2006 - Annals of Pure and Applied Logic 139 (1):1-42.details
|
|
(1 other version)Restriction respectueuse et reconstruction Des chaines et Des relations infinites.Jean Guillaume Hagendorf & J. G. Hagendorf - 1992 - Mathematical Logic Quarterly 38 (1):457-490.details
|
|
Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.details
|
|
(1 other version)Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.details
|
|
R. e. presented linear orders.Dev Kumar Roy - 1983 - Journal of Symbolic Logic 48 (2):369-376.details
|
|
An axiomatization for until and since over the reals without the IRR rule.Mark Reynolds - 1992 - Studia Logica 51 (2):165 - 193.details
|
|
On the equimorphism types of linear orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.details
|
|
On Π 1-automorphisms of recursive linear orders.Henry A. Kierstead - 1987 - Journal of Symbolic Logic 52 (3):681-688.details
|
|
(1 other version)Lexicographic Exponentiation of Chains.W. C. Holland, S. Kuhlmann & S. H. McCleary - 2005 - Journal of Symbolic Logic 70 (2):389 - 409.details
|
|
Vaught's conjecture for monomorphic theories.Miloš S. Kurilić - 2019 - Annals of Pure and Applied Logic 170 (8):910-920.details
|
|