yusuke1997/dblp-id-title huggingface dataset:
The Effects of Adding Non-Compulsory Exercises to an Online Learning Tool on Student Performance and Code Copying
Undergraduate Students' Perceptions of the Impact of Pre-College Computing Activities on Choices of Major
Impact of UX Internships on Human-computer Interaction Graduate Students: A Qualitative Analysis of Internship Reports
Iteratively Intervening with the "Most Difficult" Topics of an Algorithms and Complexity Course
RecurTutor: An Interactive Tutorial for Learning Recursion
Interactive Stitch Sampler: A Synthesis of a Decade of Research on Using Electronic Textiles to Answer the Who, Where, How, and What for K-12 Computer Science Education
Experiences on automatically assessed algorithm simulation exercises with different resubmission policies
The Impact of Pair Programming on College Students' Interest, Perceptions, and Achievement in Computer Science
Team Project Experiences in Humanitarian Free and Open Source Software (HFOSS)
"Regular" CS × Inclusive Design = Smarter Students and Greater Diversity
ClassCompass: A software design mentoring system
Creating gender parity: an instruction aide's influence
The Constraint Satisfaction Problem and Universal Algebra
2020 WINTER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Colorado Convention Center Denver, CO, USA January 17-18, 2020
Interleaving Logic and Counting
The ABC's of mice
Reverse mathematics: the playground of logic
Joseph Mileti. Modern Mathematical Logic . Cambridge University Press, Cambridge, 2022, xiv + 502 pp
Many problems, different frameworks: classification of problems in computable analysis and algorithmic learning theory
Ulrich Pardey, Frege on Absolute and Relative Truth. An Introduction to the Practice of Interpreting Philosophical Texts, History of Analytic Philosophy (no vol. number), Palgrave Macmillian, Basingstoke-New York, 2012, xxiv+242 pp
Around Exponential-Algebraic Closedness
MODEL THEORY CONFERENCE IN CELEBRATION OF LUDOMIR NEWELSKI'S 60TH BIRTHDAY CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Bedlewo, Poland December 17-21, 2022
Logicality and Model Classes
J. H. Schmerl, Subsets coded in elementary end extensions. Archive for Mathematical Logic, vol. 53 (2014), no. 5-6, pp. 571-581. - J. H. Schmerl, Minimal elementary end extensions. Archive for Mathematical Logic, vol. 56 (2017), no. 5-6, pp. 541-553
THE ANNUAL CONFERENCE OF THE AUSTRALASIAN ASSOCIATION FOR LOGIC University of Wollongong, Australia July 12, 2019
Hilbert's programs: 1917-1922
Isomorphism types of maximal cofinitary groups
Pseudofinite Structures and Counting Dimensions
Fixed point logics
A Topological Approach to Undefinability in Algebraic Extensions of
T. Button and S. Walsh. Philosophy and Model Theory. Oxford University Press, Oxford, 2018, xvi + 517 pp
Model Theory Methods for Topological Groups
Effective choice and boundedness principles in computable analysis
Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 pp
Results on Martin's Conjecture
Johnathan Kirby. An Invitation to Model Theory . Cambridge University Press, Cambridge, UK, 2019, xiv + 182 pp
Some Results in Computability Theory
Kurt Gödel on Logical, theological, and Physical antinomies
On Logics and Semantics for Interpretability
Symmetries in Modal Logics
Jon Barwise's papers on natural language semantics
Between Russell and Hilbert: Behmann on the foundations of mathematics
A model-theoretic approach to ordinal analysis
Model theory: Geometrical and set-theoretic aspects and prospects
Two applications of inner model theory to the study of Sigma 1 2 sets
Computability in Partial Combinatory Algebras
Polish metric spaces: their classification and isometry groups
Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis. Journal of Mathematical Logic, vol.6 (2006), no. 1, pp. 89-120. - Itay Neeman, The strength of Jullien's indecomposability theorem. Journal of Mathematical Logic, vol. 8 (2008), no. 1, pp. 93-119. - Itay Neeman, Necessary use ofinduction in a reversal. Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 561-574
Enumerating types of Boolean functions
James Cummings and Ernest Schimmerling, editors. Lecture Note Series of the London Mathematical Society, vol. 406. Cambridge University Press, New York, xi + 419 pp. - Paul B. Larson, Peter Lumsdaine, and Yimu Yin. An introduction to Pmax forcing. pp. 5-23. - Simon Thomas and Scott Schneider. Countable Borel equivalence relations. pp. 25-62. - Ilijas Farah and Eric Wofsey. Set theory and operator algebras. pp. 63-119. - Justin Moore and David Milovich. A tutorial on set mapping reflection. pp. 121-144. - Vladimir G. Pestov and Aleksandra Kwiatkowska. An introduction to hyperlinear and sofic groups. pp. 145-185. - Itay Neeman and Spencer Unger. Aronszajn trees and the SCH. pp. 187-206. - Todd Eisworth, Justin Tatch Moore, and David Milovich. Iterated forcing and the Continuum Hypothesis. pp. 207-244. - Moti Gitik and Spencer Unger. Short extender forcing. pp. 245-263. - Alexander S. Kechris and Robin D. Tucker-Drob. The complexity of classification problems in ergodic theory. pp. 265-299. - Menachem Magidor and Chris Lambie-Hanson. On the strengths and weaknesses of weak squares. pp. 301-330. - Boban Veličković and Giorgio Venturi. Proper forcing remastered. pp. 331-362. - Asger ToÖrnquist and Martino Lupini. Set theory and von Neumann algebras. pp. 363-396. - W. Hugh Woodin, Jacob Davis, and Daniel RodrÍguez. The HOD dichotomy. pp. 397-419
A Modular Bisimulation characterisation for Fragments of Hybrid Logic
SEVENTEENTH ASIAN LOGIC CONFERENCE AN OFFICIAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Nankai University Tianjin, China October 9-13, 2023
What is Tarski's common concept of consequence?
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
On Optimal Inverters
William Chan, An introduction to combinatorics of determinacy, Trends in Set Theory (S. Coskey and G. Sargsyan, editors), Contemporary Mathematics, vol. 752, Providence, RI, American Mathematical Society, 2020, pp. 21-75
Gödel's Program Revisited, Part I: The Turn to Phenomenology
Differential calculus and nilpotent real numbers
One-variable Fragments of First-order Logics
SYNTAX MEETS SEMANTICS (SYSMICS 2019) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Amsterdam, The Netherlands January 21-25, 2019
Kurt Gödel's First Steps in Logic: Formal Proofs in Arithmetic and Set Theory through a System of Natural Deduction
A Club Guessing Toolbox I
31ST WORKSHOP ON LOGIC, LANGUAGE, INFORMATION AND COMPUTATION (WOLLIC 2025) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Porto, Portugal July 14-17, 2025
Some aspects of model theory and finite structures
A descriptive view of combinatorial group theory
The syllogism's final solution
J. Stillwell, Reverse Mathematics: Proofs from the Inside Out, Princeton University Press, Princeton, 2018, xiii + 182 pp
Extensions and Smooth Approximations of Definable Functions in O-minimal Structures
Definable encodings in the computably enumerable sets
Counterexamples of the 0-1 law for fragments of existential second-order logic: an overview
Large Cardinals As Principles of Structural Reflection
Existential-Import Mathematics
CONFERENCE: MODEL THEORY AND GROUPS A conference on the occasion of Katrin Tent's 60th birthday CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Münster, Germany September 25-29, 2023
Transfinite progressions: a second look at completeness
Computations of Vapnik-Chervonenkis Density in Various Model-Theoretic Structures
Tautologies from pseudo-random generators
Alonzo Church and the Reviews
Using Almost-everywhere theorems from Analysis to Study Randomness
Explicit provability and constructive semantics
2023 MEETING OF THE AUSTRALASIAN ASSOCIATION FOR LOGIC University of Queensland Brisbane, Australia 9-10 November, 2023
Gregory H. Moore (ed.), The Collected Papers of Bertrand Russell, Volume 5: Toward "Principia Mathematica", London and New York: Routledge, 2014, c + 954 and 10 plates
The McKinsey-Tarski Theorem for Locally Compact Ordered Spaces
2025 SPRING MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC 2025 APA Central Division Virtual Meeting February 27 - March 1, 2025
Formalization in philosophy
Type-two well-ordering principles, admissible sets, and $\Pi _1^1$ -comprehension
Schemata: The Concept of Schema in the History of Logic
Domains for computation in mathematics, physics and exact real arithmetic
The prospects for mathematical logic in the twenty-first century
A Hierarchy of computably Enumerable Degrees
2022 WINTER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC WITH THE AMS Seattle, Washington Joint Mathematics Meeting January 7-8, 2022
IN MEMORIAM: ANNE SJERP TROELSTRA 1939-2019
Foundations and applications: axiomatization and education
2019 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium 2019 Prague, Czech Republic August 11-16, 2019
Compactness and independence in non first order frameworks
Frege's theorem and the Peano postulates
On the existence of Strong Proof Complexity Generators
Incompleteness in the finite Domain
Herman Weyl's intuitionistic mathematics
The Bulletin of Symbolic Logic
Relativizing Operational Set Theory
Degree spectra of relations on computable structures
On the diagonal Lemma of Gödel and Carnap
Ackermann's function in iterative Form: a Proof Assistant Experiment
Church's problem revisited
In Search of ultimate-l the 19th Midrasha Mathematicae Lectures
Formalization of Context-Free Language Theory
Notes on the stable Regularity Lemma
Zermelo and set theory
The Sense/Reference Distinction in Constructive Semantics
Incompleteness in a General Setting
Probability Sequent Calculi and Entropy Based Nonclassical Logics Classification
Non-standard lattices and o-minimal groups
Platonism and mathematical intuition in Kurt Gödel's thought
The strength of Abstraction with Predicative Comprehension
Foundations of Higher-Order Forcing
Deep Pi 1 0 Classes
New directions in descriptive set theory
Paraconsistent Logic Programming in Three and Four-Valued Logics
Arguments for the continuity principle
Step by recursive step: Church's analysis of effective calculability
Early Bolzano on Ground-Consequence Proofs
Association for Symbolic Logic
A universal approach to self-referential paradoxes, incompleteness and fixed points
Approximating Beppo Levi's principio di Approssimazione
Computability Theory on Polish Metric Spaces
Preservation of Structural Properties in intuitionistic Extensions of an Inference Relation
Guidelines for logic education
Decidability of admissibility: on a Problem by Friedman and its solution by Rybakov
Strong jump-Traceability
An Introduction to the Scott Complexity of Countable Structures and a Survey of Recent Results
Constructivisation through Induction and Conservation
Classification from a Computable Viewpoint
Non-Classical Set Theories and Logics Associated With Them
Finite Generators for Countable Group Actions; Finite Index Pairs of Equivalence Relations; Complexity Measures for Recursive Programs
The problem of logical constants
Shay Fuchs. Introduction to Proofs and Proof Strategies . Cambridge University Press, Cambridge, 2023, xiv + 342 pp
Model theory of analytic functions: some historical comments
J. Azzouni, Ontology without Borders, Oxford University Press, New York, 2017, xxxvi + 256 pp
2020 Winter Meeting of the Association for Symbolic Logic
Algorithmic randomness and measures of complexity
A Simplified Lower Bound for Implicational Logic
An Invitation to Model Theory and C*-Algebras
Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
Valerio Capraro and Martino Lupini, Introduction to Sofic and Hyperlinear Groups and Connes' Embedding Conjecture, Lecture Notes in Mathematics, vol. 2136, Springer International Publishing, Switzerland, 2015, viii + 151 pp
Grothendieck rings of Z-valued fields
Gentzen's Overview of Calculi and Reductions in Consistency Proofs
American logic in the 1920s
CANTOR MEETS ROBINSON CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Campinas, Brazil December 12-15, 2018
A Defense of Logicism
Alonzo Church's contributions to philosophy and intensional logic
Computable Categoricity, and Topology in Reverse Mathematics
Forcing theory and combinatorics of the real line
Automata Presenting Structures: A Survey of the Finite String Case
An elementary approach to the fine structure of L
A Brief Introduction to Algebraic Set Theory
FROM PERMUTATION GROUPS TO MODEL THEORY CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Edinburgh, UK September 17-21, 2018
Computability theory and differential geometry
An Implicative Expansion of Belnap's Four-Valued Matrix: A Modal Four-Valued Logic Without Strong Modal Lukasiewicz-Type Paradoxes
Boolean-Valued Models and Their Applications
Model Theoretic stability and Definability of Types, after a. Grothendieck
Computability Theory: Constructive Applications of the Lefthanded Local Lemma and Characterizations of Some Classes of Cohesive Powers
M. Carrara, A. Arapinis, and F. Moltmann, editors. Unity and Plurality: Logic, Philosophy, and Linguistics. Oxford University Press, 2016
Superstability and Categoricity in Abstract Elementary Classes, Carnegie Mellon University, USA, 2017. Supervised by Rami Grossberg
2021 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM '21 Adam Mickiewicz University Poznań, Poland July 19-24, 2021
Byunghan Kim. Simplicity Theory. Oxford Logic Guides, 53. Oxford University Press, Oxford, 2014, x+224 pp
Stéphane Demri, Valentin Goranko, and Martin Lange, Temporal Logics in Computer Science: Finite-state Systems, Cambridge Tracts in Theoretical Computer Science, vol. 58, Cambridge University Press, Cambridge, 2016, viii + 744 pp
Completely additive liftings
Geometrisation of First-order Logic
Hyperlinear and Sofic Groups: A Brief Guide
From "metabelian Q-vector spaces" to new infinity-stable groups
The complexity of classification problems for models of arithmetic
Disjunctions with Stopping conditions
A Survey of Propositional Realizability Logic
The road to modern logic - An interpretation
A note on continuous Functions on Metric Spaces
Is the Euclidean algorithm optimal among its peers?
Inner models and large cardinals
On arbitrary sets and ZFC
Of sheep and Wolves: Equivalence and Disagreement in Set Theory
Vaught's Two-Cardinal Theorem and Notions of Minimality in Continuous Logic
Compact Structures in Descriptive Classification Theory
Andrew Marks and Spencer Unger, Borel circle squaring, Annals of Mathematics, (2017), no. 186, pp. 581-605
Permutations of the Integers Induce only the Trivial automorphism of the Turing Degrees
Barwise: Abstract model theory and generalized quantifiers
A Theory of Stationary Trees and the Balanced Baumgartner-Hajnal-Todorcevic Theorem for Trees
Machines, logic and quantum physics
Transfer Principles in Henselian Valued Fields
An editor recalls some hopeless papers
Papers on weak first-order theories and decidability problems
Shift-complex sequences
Reduction Techniques for Proving Decidability in Logics and their Meet-Combination
Studies on Partial Impredicativity in Formal Systems of Arithmetic and Computability Theory
C*-algebras and the Uncountable: A Systematic Study of the Combinatorics of the Uncountable in the Noncommutative Framework
YOUNG SET THEORY XII 2019 COSPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Vienna, Austria June 26-29, 2019
On Representations of irrational numbers and the Computational Complexity of Converting between such Representations
Brouwer and Fraenkel on intuitionism
Actions of Groups of Finite Morley Rank on Small Abelian Groups
Singular cardinals and the PCF theory
Mass problems and randomness
Fifty years of the spectrum problem: survey and new results
How to compute antiderivatives
Kleene's amazing Second Recursion Theorem
Circularity in Soundness and Completeness
Computable Abelian Groups
In Memoriam: Mati Rubin 1946-2017
2023 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM 2023 University of Milan Milan, Italy June 5 - June 9, 2023
HILBERT-BERNAYS SUMMER SCHOOL ON LOGIC AND COMPUTATION 2019 COSPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Tübingen, Germany July 21-27, 2019
THE SIXTEENTH INTERNATIONAL CONFERENCE ON COMPUTABILITY AND COMPLEXITY IN ANALYSIS (CCA 2019) Zagreb, Croatia July 8-11, 2019
Model Theory in a Paraconsistent Environment
G. A. Elliott, I. Farah, V. I. Paulsen, C. Rosendal, A. S. Toms, and A. Törnquist. The isomorphism relation for separable C*-algebras. Mathematics Research Letters, vol. 20 (2013), no. 6, pp. 1071-1080. - Marcin Sabok. Completeness of the isomorphism problem for separable C*-algebras. Inventiones Mathematicae, to appear, published online at link.springer.com/journal/222
Incompatibility of Generic Hugeness Principles
Manuel Bodirsky. Complexity of Infinite-Domain Constraint Satisfaction . Lecture Notes in Logic, vol. 52. Cambridge University Press, 2021
Regularity of Ultrafilters, Boolean Ultrapowers, and Keisler's Order
Edgar Morscher, Normenlogik. Grundlagen - Systeme - Anwendungen. Paderborn, Mentis, 2012. 309 pp., ISBN-13: 978-3897857841
Degree Structures: Local and Global Investigations
In Memoriam: Éric Jaligot 1972-2013
12TH PANHELLENIC LOGIC SYMPOSIUM (PLS 12, 2019) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Anogeia, Crete, Greece June 26-30, 2019
In Memoriam: Solomon Feferman (1928-2016)
A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus
19th century logic between philosophy and mathematics
EUROPEAN SET THEORY CONFERENCE VII 2019 CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Vienna, Austria July 1-5, 2019
The logic of bunched implications
New Results in Model Theory and Set Theory
Eta-Rules in Martin-löF Type Theory
M. Grohe, Descriptive Complexity, Canonisation, and Definable Graph Structure Theory, Cambridge University Press, Cambridge, 2017, x + 544 pp
Monadic Intuitionistic and Modal Logics Admitting Provability Interpretations
Ordered groups: a case study in reverse mathematics
Thomas Piecha and Peter Schroeder-Heister. Incompleteness of Intuitionistic Propositional Logic with Respect to Proof-Theoretic Semantics . Studia Logica , vol. 107 (2019), no. 1, pp. 233-246. - Alexander V. Gheorghiu, Tao Gu and David J. Pym. Proof-Theoretic Semantics for Intuitionistic Multiplicative Linear Logic . Automated Reasoning with Analytic Tableaux and Related Methods, Revantha Ramanayake and Josef Urban, Lecture Notes in Computer Science, vol. 14278, Springer, Cham, pp. 367-385. - Hermógenes Oliveira. On Dummett's Pragmatist Justification Procedure . Erkenntnis , vol. 86 (2021), no. 2, pp. 429-455
The absolute arithmetic continuum and the unification of all numbers great and small
Gödel's second Incompleteness Theorem: How IT is derived and What IT Delivers
Algebraic logic, where does it stand today?
Logic in the 1930s: type theory and model theory
Extended Frames and Separations of Logical Principles
C. T. Conley and B. D. Miller, A bound on measurable chromatic numbers of locally finite Borel graphs . Mathematical Research Letters, vol. 23, no. 6 (2016), pp. 1633-1644
CIE 2019: COMPUTING WITH FORESIGHT AND INDUSTRY COSPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Durham, UK July 15-19, 2019
Future tasks for Gödel scholars
Vladimir Kanovei, Marcin Sabok, and Jindřich Zapletal, Canonical Ramsey Theory on Polish Spaces, Cambridge Tracts in Mathematics, vol. 202, Cambridge University Press, Cambridge, 2013, viii + 269 pp
Two spaces looking for a geometer
Computing k-Trivial Sets by Incomplete Random Sets
Automatic continuity of group homomorphisms
V = L and intuitive plausibility in set theory. A case study
Semantics modulo satisfiability with applications: function representation, probabilities and game theory
Continuous Abstract Data Types for Verified Computation
New programs and open problems in the foundation of mathematics
Intuitionistic Analysis at the End of Time
Forcing in proof theory
Hyperfinite law of large numbers
When are two algorithms the same?
Does mathematics need new axioms?
From real-life to very strong axioms. Classification problems in Descriptive Set Theory and regularity properties in Generalized Descriptive Set Theory
Denis R. Hirschfeldt. Slicing the truth: On the computable and reverse mathematics of combinatorial principles. Lecture Note Series, Institute for Mathematical Sciences, National University of Singapore, vol. 28. World Scientific Publishing Co. Pte. Ltd., Singapore, 2015, xiv+214 pp
Von Neumann, Gödel and complexity theory
Corona Rigidity
Games for truth
COMPACTNESS OF AND STRONG AXIOMS OF DETERMINACY - N. Trang, Structure theory of and its applications . Journal of Symbolic Logic , vol. 80 (2015), no. 1, pp. 29-55. - N. Trang, Supercompactness can be equiconsistent with measurability . Notre Dame Journal of Formal Logic , vol. 62 (2021), no. 4, pp. 593-618. - N. Trang and T. Wilson, Determinacy from strong compactness of . Annals of Pure and Applied Logic , vol. 172 (2021), no. 6, Article no. 102944, 30pp. - D. Ikegami and N. Trang, On supercompactness of $\omega _1$, Advances in Mathematical Logic (T. Arai, M. Kikuchi, S. Kuroda, M. Okada, T. Yorioka, editors), Springer, Proceedings Mathematics & Statistics, Singapore, 369, 2021, pp. 27-45
On some of Brouwer's Axioms
Foundations of Online Structure Theory
Full Development of Tarski's Geometry of Solids
Computability and recursion
BSL volume 30 issue 1 Cover and Front matter
2020 North American Annual Meeting of the Association for Symbolic Logic, University of California, Irvine Irvine, California, USA March 25-28, 2020
Predicative fragments of Frege Arithmetic
Classifying the Provably Total Functions of PA
Open questions in reverse mathematics
Gödel's reformulation of Gentzen's first consistency proof for arithmetic: the no-counterexample interpretation
Partition Theorems and Computability Theory
Filling cages. Reverse mathematics and combinatorial principles
Coding into Inner Models at the Level of Strong Cardinals
The Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics. http: //homotopytypetheory.org/book, Institute for Advanced Study, 2013, vii + 583 pp
Henkin Constructions of Models with Size continuum
Compact Metrizable Structures via Projective Fraïssé Theory With an Application to the Study of Fences
The role of true finiteness in the admissible recursively enumerable degrees
Intrinsic density, asymptotic computability, and stochasticity
Terminal notions
Tim Button. Level Theory, Part 1: Axiomatizing the Bare Idea of a Cumulative Hierarchy of Sets The Bulletin of Symbolic Logic, vol. 27 (2021), no. 4, pp. 436-460. - Tim Button. Level Theory, Part 2: Axiomatizing the Bare Idea of a Potential Hierarchy The Bulletin of Symbolic Logic, vol. 27 (2021), no. 4, pp. 461-484. - Tim Button. Level Theory, Part 3: A Boolean Algebra of Sets Arranged in Well-Ordered Levels The Bulletin of Symbolic Logic, vol. 28 (2022), no. 1, pp. 1-26
Under Lock and Key: a Proof System for a Multimodal Logic
BSL volume 30 issue 1 Cover and Back matter
Reconsidering Ordered Pairs
Combinatorial dichotomies in set theory
Early history of the Generalized Continuum Hypothesis: 1878 - 1938
The Jacobson radical of a Propositional Theory
A note on the Theory of Well Orders
Set Theory and C*-Algebras
Nonstandard Models in Recursion Theory and Reverse Mathematics
Tiering as a recursion technique
What is neologicism?
Describing Groups
The Horn theory of Boole's partial algebras
N. Francez, Proof-theoretic semantics, Studies in Logic, vol. 57 College Publications, London, 2015, xx + 415 pp
THIRTEENTH INTERNATIONAL CONFERENCE ON COMPUTABILITY, COMPLEXITY AND RANDOMNESS (CCR 2018) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Santiago, Chile December 17-21, 2018
A Classical Modal Theory of Lawless sequences
Second order logic or set theory?
2018 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium 2018 - addendum
A basis theorem for perfect sets
New dichotomies for Borel equivalence relations
Local initial segments of the Turing degrees