Leo Harrington. Recursively presentable prime models. The journal of symbolic logic, vol. 39 (1974), pp. 305–309. - Terrences. Millar. Foundations of recursive model theory. Annals of mathematical logic, vol. 13 (1978), pp. 45–72. - Terrence S. Millar. A complete, decidable theory with two decidable models. The journal of symbolic logic, vol. 44 (1979), pp. 307–312.

1984 ◽  
Vol 49 (2) ◽  
pp. 671-672
Author(s):  
C. J. Ash
Keyword(s):  
Mathematical Logic ◽  
Model Theory ◽  
Symbolic Logic ◽  
Recursive Model ◽  
Decidable Theory

S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical Logic, vol. 45 (2006), no. 5, pp. 519–538. - Chris Ash, Julia Knight, Mark Manasse and Theodore Slaman. Generic copies of countable structures. Annals of Pure and Applied Logic, vol. 42 (1989), no. 3, pp. 195–205. - John Chisholm. Effective model theory vs. recursive model theory. The Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1168–1191.

2012 ◽  
Vol 18 (1) ◽  
pp. 131-134
Author(s):  
Daniel Turetsky
Keyword(s):  
Mathematical Logic ◽  
Model Theory ◽  
American Mathematical Society ◽  
Effective Model ◽  
Mathematical Society ◽  
Symbolic Logic ◽  
Applied Logic ◽  
Recursive Model ◽  
Linear Orderings ◽  
Scott Family

Classifying model-theoretic properties

2008 ◽  
Vol 73 (3) ◽  
pp. 885-905 ◽  
Author(s):  
Chris J. Conidis
Keyword(s):  
Model Theory ◽  
Computability Theory ◽  
Prime Model ◽  
Decidable Theory ◽  
Dense Sets ◽  
Equivalent Properties ◽  
The Relationship

AbstractIn 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A ≤T 0′ is nonlow2 if and only if A is prime bounding, i.e., for every complete atomic decidable theory T, there is a prime model computable in A. The authors presented nine seemingly unrelated predicates of a set A, and showed that they are equivalent for sets. Some of these predicates, such as prime bounding, and others involving equivalence structures and abelian p-groups come from model theory, while others involving meeting dense sets in trees and escaping a given function come from pure computability theory.As predicates of A, the original nine properties are equivalent for sets; however, they are not equivalent in general. This article examines the (degree-theoretic) relationship between the nine properties. We show that the nine properties fall into three classes, each of which consists of several equivalent properties. We also investigate the relationship between the three classes, by determining whether or not any of the predicates in one class implies a predicate in another class.

Tarski

Truth ◽  
2011 ◽  
Author(s):  
Alexis G. Burgess ◽  
John P. Burgess
Keyword(s):  
Mathematical Logic ◽  
Model Theory ◽  
The State ◽  
Truth Predicate ◽  
Object Language ◽  
French And English ◽  
Direct Definition ◽  
Definition Of ◽  
Basic Features ◽  
Self Reference

This chapter offers a simplified account of the most basic features of Alfred Tarski's model theory. Tarski foresaw important applications for a notion of truth in mathematics, but also saw that mathematicians were suspicious of that notion, and rightly so given the state of understanding of it circa 1930. In a series of papers in Polish, German, French, and English from the 1930s onward, Tarski attempted to rehabilitate the notion for use in mathematics, and his efforts had by the 1950s resulted in the creation of a branch of mathematical logic known as model theory. The chapter first considers Tarski's notion of truth, which he calls “semantic” truth, before discussing his views on object language and metalanguage, recursive versus direct definition of the truth predicate, and self-reference.

scholarly journals Relative Necessity and Propositional Quantification

2019 ◽  
Vol 49 (4) ◽  
pp. 703-726
Author(s):  
Alexander Roberts
Keyword(s):  
Mathematical Logic ◽  
Propositional Logic ◽  
Recent Article ◽  
Symbolic Logic ◽  
Philosophical Logic ◽  
Alternative Account ◽  
Standard Account ◽  
Current Article ◽  
Modal Propositional Logic ◽  
Propositional Quantification

AbstractFollowing Smiley’s (The Journal of Symbolic Logic, 28, 113–134 1963) influential proposal, it has become standard practice to characterise notions of relative necessity in terms of simple strict conditionals. However, Humberstone (Reports on Mathematical Logic, 13, 33–42 1981) and others have highlighted various flaws with Smiley’s now standard account of relative necessity. In their recent article, Hale and Leech (Journal of Philosophical Logic, 46, 1–26 2017) propose a novel account of relative necessity designed to overcome the problems facing the standard account. Nevertheless, the current article argues that Hale & Leech’s account suffers from its own defects, some of which Hale & Leech are aware of but underplay. To supplement this criticism, the article offers an alternative account of relative necessity which overcomes these defects. This alternative account is developed in a quantified modal propositional logic and is shown model-theoretically to meet several desiderata of an account of relative necessity.

Sign in / Sign up

Export Citation Format

Share Document