default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Review of Symbolic Logic, Volume 13
Volume 13, Number 1, March 2020
- Lawrence S. Moss, Selçuk Topal
:
Syllogistic Logic with Cardinality comparisons, on Infinite Sets. 1-22 - Rebecca Lea Morris:
Motivated Proofs: What they are, Why they Matter and How to Write them. 23-46 - Jeremy Avigad:
Modularity in Mathematics. 47-79 - Eduardo Alejandro Barrio, Federico Matias Pailos, Damián Enrique Szmuc:
A Recovery operator for Nontransitive Approaches. 80-104 - Edoardo Rivello:
Formal Representations of Dependence and Groundedness. 105-140 - Marko Malink, Anubav Vasudevan:
The Peripatetic Program in Categorical Logic: Leibniz on Propositional Terms. 141-205 - Daniel Kirchner, Christoph Benzmüller, Edward N. Zalta:
Mechanizing Principia Logico-Metaphysica in Functional Type-Theory. 206-218
Volume 13, Number 2, June 2020
- Miroslav Hanke:
Seventeenth-Century Scholastic Syllogistics. Between Logic and Mathematics? 219-248 - Federico Matias Pailos:
A Fully Classical Truth Theory characterized by Substructural means. 249-268 - Albert Visser:
Another Look at the second Incompleteness Theorem. 269-295 - Colin McLarty:
The Large Structures of Grothendieck Founded on finite-order Arithmetic. 296-325 - Zalán Gyenis:
Standard Bayes Logic is not Finitely Axiomatizable. 326-337 - Tommaso Moraschini, James G. Raftery, Jamie J. Wannenburg:
Varieties of de Morgan Monoids: Covers of atoms. 338-374 - Monroe Eskew:
Generic Large Cardinals as Axioms. 375-387 - Paul Anh McEldowney:
On Morita Equivalence and interpretability. 388-415 - Sergei P. Odintsov, Stanislav O. Speranski:
Belnap-Dunn Modal Logics: Truth constants vs. Truth Values. 416-435 - Ethan Brauer:
Relevance for the Classical Logician. 436-457
Volume 13, Number 3, September 2020
- Grigory K. Olkhovikov:
Restricted interpolation and Lack thereof in STIT Logic. 459-482 - Alex Citkin:
Hereditarily Structurally Complete positive Logics. 483-502 - Joseph Y. Halpern:
A note on the existence of Ratifiable Acts. 503-508 - Minghui Ma, Ahti-Veikko Pietarinen:
Peirce's Calculi for Classical Propositional Logic. 509-540 - Walter Dean:
Incompleteness via Paradox and Completeness. 541-592 - Tommaso Flaminio:
Three Characterizations of Strict Coherence on Infinite-Valued Events. 593-610 - Robert Goldblatt, Ian M. Hodkinson:
Strong Completeness of Modal Logics over 0-dimensional Metric Spaces. 611-632 - Mohamed Khaled, Gergely Székely, Koen Lefever, Michèle Friend:
Distances between Formal Theories. 633-654 - Tore Fjetland Øgaard:
Substitution in Relevant Logics. 655-680
Volume 13, Number 4, December 2020
- Jemma Lorenat:
Certain Modern Ideas and Methods: "Geometric Reality" in the Mathematics of Charlotte Angas Scott. 681-719 - Sergey Drobyshevich, Heinrich Wansing:
Proof Systems for various FDE-based Modal Logics. 720-747 - Adam Bjorndahl, Aybüke Özgün:
Logic and Topology for Knowledge, Knowability, and Belief. 748-775 - Daniyar S. Shamkanov:
Non-Well-Founded Derivations in the Gödel-löB Provability Logic. 776-796 - Chris Scambler:
Ineffability and Revenge. 797-809 - Mario Piazza, Gabriele Pulcini:
Fractional Semantics for Classical Logic. 810-828 - Michael Caie:
Bunder's Paradox. 829-844 - Michael Kaminski, Nissim Francez:
De Morgan Interpretation of the Lambek-Grishin Calculus. 845-856 - Philip D. Welch:
Some observations on Truth Hierarchies: a correction. 857-860 - Hajnal Andréka, István Németi, Steven Givant:
Nonrepresentable Relation Algebras from Groups. 861-881 - Andreas Fjellstad:
A note on the Cut-Elimination Proof in "Truth without contra(di)Ction". 882-886 - Yale Weiss:
Cut and Gamma I: Propositional and Constant Domain R. 887-909
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
