13629 results in The Journal of Symbolic Logic
A model with no magic set
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1467-1490
- Print publication:
- December 1999
-
- Article
- Export citation
Finite sets and frege structures
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1552-1556
- Print publication:
- December 1999
-
- Article
- Export citation
Henry Prakken. Logical tools for modelling legal argument. A study of defeasible reasoning in law. Law and philosophy library, vol. 32. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1997, xiii + 314 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1840-1841
- Print publication:
- December 1999
-
- Article
- Export citation
Proof theory of modal logic, edited by Heinrich Wansing, Applied logic series, vol. 2, Kluwer Academic Publishers, Dordrecht, Boston, and London, 1996, x + 317 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1825-1828
- Print publication:
- December 1999
-
- Article
- Export citation
Cardinal preserving ideals
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1527-1551
- Print publication:
- December 1999
-
- Article
- Export citation
Interpretability over peano arithmetic
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1407-1425
- Print publication:
- December 1999
-
- Article
- Export citation
J.-J. Ch. Meyer and W. Van Der Hoek. Epistemic logic for AI and computer science. Cambridge tracts in theoretical computer science, no. 41. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1995, xiii + 354 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1837-1840
- Print publication:
- December 1999
-
- Article
- Export citation
Cantor-Bendixson Rank of the Ziegler Spectrum Over a Commutative Valuation Domain
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1512-1518
- Print publication:
- December 1999
-
- Article
- Export citation
On measurable limits of compact cardinals
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1675-1688
- Print publication:
- December 1999
-
- Article
- Export citation
A set with barely degree
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1700-1718
- Print publication:
- December 1999
-
- Article
- Export citation
Free set algebras satisfying systems of equations
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1656-1674
- Print publication:
- December 1999
-
- Article
- Export citation
Displaying the modal logic of consistency
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1573-1590
- Print publication:
- December 1999
-
- Article
- Export citation
Standardization principle of nonstandard universes
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1645-1655
- Print publication:
- December 1999
-
- Article
- Export citation
Jon Barwise and Jerry Seligman. Information flow. The logic of distributed systems. Cambridge tracts in theoretical computer science, no. 44. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, xv + 274 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, p. 1836
- Print publication:
- December 1999
-
- Article
- Export citation
Proof complexity and feasible arithmetics, DIMACS workshop, April 21–24, 1996, edited by Paul W. Beame and Samuel R. Buss, Series in discrete mathematics and theoretical computer science, vol. 39, American Mathematical Society, Providence1998, xii + 320 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1823-1825
- Print publication:
- December 1999
-
- Article
- Export citation
Jan Krajíček, Pavel Pudlák, and Gaisi Takeuti. Bounded arithmetic and the polynomial hierarchy. Ibid., vol. 52 (1991), pp. 143–153. - Samuel R. Buss. Relating the bounded arithmetic and polynomial time hierarchies. Ibid., vol. 75 (1995), pp. 67–77. - Domenico Zambella. Notes on polynomially bounded arithmetic. The journal of symbolic logic, vol. 61 (1996), pp. 942–966.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1821-1823
- Print publication:
- December 1999
-
- Article
- Export citation
No elementary embedding from v into v is definable from parameters
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1591-1594
- Print publication:
- December 1999
-
- Article
- Export citation
J. Roger Hindley. Basic simple type theory. Cambridge tracts in theoretical computer science, no. 42. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1997, xi + 186 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1832-1833
- Print publication:
- December 1999
-
- Article
- Export citation
Lambèr M. M. Royakkers. Extending deontic logic for the formalisation of legal rules. Law and philosophy library, vol. 36. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1998, ix + 191 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1841-1842
- Print publication:
- December 1999
-
- Article
- Export citation
Lowness for the class of random sets
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1396-1402
- Print publication:
- December 1999
-
- Article
- Export citation