1635 results in Bulletin of Symbolic Logic
28th WORKSHOP ON LOGIC, LANGUAGE, INFORMATION AND COMPUTATION (WoLLIC 2021) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Virtual Event October 5–8, 2021
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, p. 725
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
THE 19TH LATIN AMERICAN SYMPOSIUM ON MATHEMATICAL LOGIC OF THE ASSOCIATION FOR SYMBOLIC LOGIC XIX SIMPOSIO LATINOAMERICANO DE LÓGICA MATEMÁTICA Universidad de Costa Rica San José, Costa Rica July 26–31, 2022
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. 703-724
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
BSL volume 29 issue 4 Cover and Front matter
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. f1-f4
- Print publication:
- December 2023
-
- Article
-
- You have access
- Export citation
Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook. Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero, pp. 3–28. - Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron, pp. 29–44. - Stephen A. Cook, Overview of Computational Complexity, pp. 47–70. - Christos H. Papadimitriou, Cook’s NP-Completeness Paper and the Dawn of the New Theory, pp. 73–82. - Jan Krajíček, The Cook–Reckhow Definition, pp. 83–94. - Sam Buss, Polynomially Verifiable Arithmetic, pp. 95–106. - Paul Beame and Pierre McKenzie, Towards a Complexity Theory of Parallel Computation, pp. 107–126. - Nicholas Pippenger, Computation with Limited Space, pp. 127–140. - Stephen A. Cook, The Complexity of Theorem-Proving Procedures, pp. 143–152. - Stephen A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, pp. 153–172. - Stephen A. Cook and Robert A. Reckhow, The Relative Efficiency of Propositional Proof Systems, pp. 173–192. - Stephen A. Cook, Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version), pp. 193–218. - Stephen A. Cook, Towards a Complexity Theory of Synchronous Parallel Computation, pp. 219–244. - Allan Borodin and Stephen A. Cook, A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation, pp. 245–260. - Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, and Rahul Santhanam, Pebbles and Branching Programs for Tree Evaluation, pp. 261–318. - Bruce M. Kapron, Cook’s Berkeley Notes, pp. 321–324. - Stephen A. Cook, A Survey of Classes of Primitive Recursive Functions, pp. 325–336.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. 657-660
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
Computability Theory on Polish Metric Spaces
- Part of:
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, p. 664
- Print publication:
- December 2023
-
- Article
-
- You have access
- Export citation
CONTENTS OF VOLUME 29
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. i-ii
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
2023 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC University of California, Irvine Irvine, CA, USA March 25–29, 2023
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. 672-695
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
Weak Indestructibility and Reflection
- Part of:
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, p. 663
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
NOTICES
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. 726-732
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
2023 WINTER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Boston, Massachusetts Joint Mathematics Meeting January 6–7, 2023
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. 666-671
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
John Steel and Hugh Woodin. HOD as a Core Model. Ordinal Definability and Recursion Theory: The Cabal Seminar, Volume III, edited by Alexander Kechris, Benedikt Lowe, and John Steel, Lecture Notes in Logic, vol. 3, Cambridge University Press, Cambridge, pp. 257–345.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. 656-657
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
Ordered Groups, Computability and Cantor-Bendixson Rank
- Part of:
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, p. 664
- Print publication:
- December 2023
-
- Article
-
- You have access
- Export citation
D. D. Dzhafarov and C. Mummert, Reverse Mathematics: Problems, Reductions, and Proofs. Theory and Applications of Computability. Springer Nature, Cham, 2022, xix + 488 pp.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 23 February 2024, pp. 660-662
- Print publication:
- December 2023
-
- Article
-
- You have access
- HTML
- Export citation
ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS
- Part of:
-
- Journal:
- Bulletin of Symbolic Logic / Volume 30 / Issue 1 / March 2024
- Published online by Cambridge University Press:
- 22 November 2023, pp. 20-40
- Print publication:
- March 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF $\mathbb {Q}$
- Part of:
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
- Published online by Cambridge University Press:
- 29 September 2023, pp. 626-655
- Print publication:
- December 2023
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
NOTICES
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 3 / September 2023
- Published online by Cambridge University Press:
- 12 October 2023, pp. 458-464
- Print publication:
- September 2023
-
- Article
-
- You have access
- HTML
- Export citation
BSL volume 29 issue 3 Cover and Back matter
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 3 / September 2023
- Published online by Cambridge University Press:
- 12 October 2023, pp. b1-b2
- Print publication:
- September 2023
-
- Article
-
- You have access
- Export citation
BSL volume 29 issue 3 Cover and Front matter
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 3 / September 2023
- Published online by Cambridge University Press:
- 12 October 2023, pp. f1-f3
- Print publication:
- September 2023
-
- Article
-
- You have access
- Export citation
THREE PAPERS ON RECENT WORK ON META-VALIDITY - David Ripley, One step is enough. Journal of Philosophical Logic, vol. 51 (2022), pp. 1233–1259. - Isabella McAllister, Classical logic is not uniquely characterizable. Journal of Philosophical Logic, vol. 51 (2022), pp. 1345–1365. - Rea Golan, There is no tenable notion of global metainferential validity. Analysis, vol. 81 (2021), no. 3, pp. 411–420.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 3 / September 2023
- Published online by Cambridge University Press:
- 12 October 2023, pp. 453-456
- Print publication:
- September 2023
-
- Article
-
- You have access
- HTML
- Export citation
John MacFarlane, Philosophical Logic: A Contemporary Introduction, Routledge Contemporary Introductions to Philosophy, Routledge, New York, and London, 2021, xx + 238 pp.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 29 / Issue 3 / September 2023
- Published online by Cambridge University Press:
- 12 October 2023, pp. 456-457
- Print publication:
- September 2023
-
- Article
-
- You have access
- HTML
- Export citation