13629 results in The Journal of Symbolic Logic
Pairs without infimum in the recursively enumerable weak truth table degrees
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 117-129
- Print publication:
- March 1986
-
- Article
- Export citation
Daniel Lascar and Bruno Poizat. An introduction to forking. The journal of symbolic logic, vol. 44 (1979), pp. 330–350.
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 234-235
- Print publication:
- March 1986
-
- Article
- Export citation
Elementary equivalence of Cσ(K) spaces for totally disconnected, compact Hausdorff K
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 135-146
- Print publication:
- March 1986
-
- Article
- Export citation
Omitting types in -minimal theories
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 63-74
- Print publication:
- March 1986
-
- Article
- Export citation
Partitions and filters
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 12-21
- Print publication:
- March 1986
-
- Article
- Export citation
Pragmatic truth and approximation to truth1
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 201-221
- Print publication:
- March 1986
-
- Article
- Export citation
Decision problems concerning properties of finite sets of equations
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 79-87
- Print publication:
- March 1986
-
- Article
- Export citation
The natural hierarchy and quasi-hierarchy of constructibility degrees
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 130-134
- Print publication:
- March 1986
-
- Article
- Export citation
JSL volume 51 issue 1 Cover and Back matter
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. b1-b2
- Print publication:
- March 1986
-
- Article
-
- You have access
- Export citation
Stationary reflections for uncountable cofinality
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 147-151
- Print publication:
- March 1986
-
- Article
- Export citation
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 (1979), pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springer-Verlag, Berlin, Heidelberg, and New York, 1978, pp. 403–415. - Dexter Kozen and Rohit Parikh. An elementary proof of the completeness of PDL. Theoretical computer science, vol. 14(1981), pp. 113–118.
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 225-227
- Print publication:
- March 1986
-
- Article
- Export citation
Noam Chomsky. Lectures on government and binding. The Pisa lectures. Studies in generative grammar, no. 9. Foris Publications, Dordrecht and Cinnaminson, N.J., 1981, ix + 371 pp. - Noam Chomsky. Lectures on government and binding. The Pisa lectures. Second edition of the preceding. Studies in generative grammar, no. 9. Foris Publications, Dordrecht and Cinnaminson, N.J., 1982, ix + 371 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 238-240
- Print publication:
- March 1986
-
- Article
- Export citation
Tarski's problem for varieties of groups with a commutator identity
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 75-78
- Print publication:
- March 1986
-
- Article
- Export citation
J. A. Robinson. Logic: form and function. The mechanization of deductive reasoning. Artificial intelligence series. North-Holland, New York1979, vi + 312 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 227-229
- Print publication:
- March 1986
-
- Article
- Export citation
Intuitionistic tense and modal logic
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 166-179
- Print publication:
- March 1986
-
- Article
- Export citation
Donald Nute. Essential formal semantics. Rowman and Littlefield, Totowa, N.J., 1981, xiii + 186 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 252-253
- Print publication:
- March 1986
-
- Article
- Export citation
On the intersection of closed unbounded sets
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 180-189
- Print publication:
- March 1986
-
- Article
- Export citation
V. A. Uspensky. Post's machine. English translation by R. Alavina of Mašina Posta. Little mathematics library. Mir Publishers, Moscow, also distributed by Imported Publications, Chicago, 1983, 88 pp. - Emil L. Post. Finite combinatory processes—formulation 1. A reprint of II 43. Therein, pp. 84–88.
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 253-254
- Print publication:
- March 1986
-
- Article
- Export citation
Saturation of homogeneous resplendent models
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 222-224
- Print publication:
- March 1986
-
- Article
- Export citation
Karel Lambert. Meinong and the principle of independence. Its place in Meinong's theory of objects and its significance in contemporary philosophical logic. Modern European philosophy. Cambridge University Press, Cambridge etc. 1983, xvi + 175 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 1 / March 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 248-252
- Print publication:
- March 1986
-
- Article
- Export citation