- Local definability theory.Gonzalo E. Reyes - 1970 - Annals of Mathematical Logic 1 (1):95-137.details
|
|
Model-theoretic complexity of automatic structures.Bakhadyr Khoussainov & Mia Minnes - 2010 - Annals of Pure and Applied Logic 161 (3):416-426.details
|
|
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.details
|
|
De finetti, countable additivity, consistency and coherence.Colin Howson - 2008 - British Journal for the Philosophy of Science 59 (1):1-23.details
|
|
Atomic models higher up.Jessica Millar & Gerald E. Sacks - 2008 - Annals of Pure and Applied Logic 155 (3):225-241.details
|
|
Finite variable logics in descriptive complexity theory.Martin Grohe - 1998 - Bulletin of Symbolic Logic 4 (4):345-398.details
|
|
Games and trees in infinitary logic: A survey.Jouko Väänänen - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 105--138.details
|
|
Notes on Cardinals That Are Characterizable by a Complete (Scott) Sentence.Ioannis Souldatos - 2014 - Notre Dame Journal of Formal Logic 55 (4):533-551.details
|
|
On inverse γ-systems and the number of l∞λ- equivalent, non-isomorphic models for λ singular.Saharon Shelah & Pauli Väisänen - 2000 - Journal of Symbolic Logic 65 (1):272 - 284.details
|
|
Computable Scott sentences and the weak Whitehead problem for finitely presented groups.Gianluca Paolini - 2024 - Annals of Pure and Applied Logic 175 (7):103441.details
|
|
Infinitary logic.John L. Bell - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
Scott sentences and admissible sets.Mark Nadel - 1974 - Annals of Mathematical Logic 7 (2):267.details
|
|
Classification from a computable viewpoint.Wesley Calvert & Julia F. Knight - 2006 - Bulletin of Symbolic Logic 12 (2):191-218.details
|
|
Infinite lexicographic products.Nadav Meir - 2022 - Annals of Pure and Applied Logic 173 (1):102991.details
|
|
On characterizability in L ω1ω0.Per Lindström - 1966 - Theoria 32 (3):165-171.details
|
|
Generalized interpolation and definability.David W. Kueker - 1970 - Annals of Mathematical Logic 1 (4):423.details
|
|
Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.details
|
|
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.details
|
|
The plain man's guide to probability. [REVIEW]Colin Howson - 1972 - British Journal for the Philosophy of Science 23 (2):157-170.details
|
|
Modelling uncertain inference.Colin Howson - 2012 - Synthese 186 (2):475-492.details
|
|
Can logic be combined with probability? Probably.Colin Howson - 2009 - Journal of Applied Logic 7 (2):177-187.details
|
|
A new approach to infinitary languages.J. Hintikka - 1976 - Annals of Mathematical Logic 10 (1):95.details
|
|
Hanf number for Scott sentences of computable structures.S. S. Goncharov, J. F. Knight & I. Souldatos - 2018 - Archive for Mathematical Logic 57 (7-8):889-907.details
|
|
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.details
|
|
The significance test controversy. [REVIEW]Ronald N. Giere - 1972 - British Journal for the Philosophy of Science 23 (2):170-181.details
|
|
Bounds on Weak Scattering.Gerald E. Sacks - 2007 - Notre Dame Journal of Formal Logic 48 (1):5-31.details
|
|
Scott rank of Polish metric spaces.Michal Doucha - 2014 - Annals of Pure and Applied Logic 165 (12):1919-1929.details
|
|
Partial Isomorphisms and Infinitary Languages.Jean-Pierre Calais - 1972 - Mathematical Logic Quarterly 18 (25‐30):435-456.details
|
|
Infinitary properties of abelian torsion groups.Jon Barwise & Paul Eklof - 1970 - Annals of Mathematical Logic 2 (1):25-68.details
|
|