default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLFCS 2022: Deerfield Beach, FL, USA
- Sergei N. Artëmov
, Anil Nerode:
Logical Foundations of Computer Science - International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings. Lecture Notes in Computer Science 13137, Springer 2022, ISBN 978-3-030-93099-8 - Juan P. Aguilera, Jan Bydzovsky, David Fernández-Duque:
A Non-hyperarithmetical Gödel Logic. 1-8 - Matthias Baaz, Anela Lolic:
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily. 9-24 - Douglas Cenzer, Richard Krogman:
The Isomorphism Problem for FST Injection Structures. 25-36 - Neil J. DeBoer:
Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic. 37-51 - David Fernández-Duque, Konstnatinos Papafilippou, Joost J. Joosten:
Hyperarithmetical Worm Battles. 52-69 - Yannick Forster:
Parametric Church's Thesis: Synthetic Computability Without Choice. 70-89 - Christian Hagemeier, Dominik Kirst:
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic. 90-111 - Bjørn Kjos-Hanssen, Saroj Niraula, Soowhan Yoon:
A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance. 112-124 - Juha Kontinen, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. 125-142 - David Lehnherr, Zoran Ognjanovic, Thomas Studer:
A Logic of Interactive Proofs. 143-155 - Yanhong A. Liu, Scott D. Stoller:
Recursive Rules with Aggregation: A Simple Unified Semantics. 156-179 - Sérgio Marcelino, Carlos Caleiro, Pedro Filipe:
Computational Properties of Partial Non-deterministic Matrices and Their Logics. 180-197 - Eoin Moore:
Soundness and Completeness Results for LEA and Probability Semantics. 198-216 - Shota Motoura, Shin-ya Katsumata:
On Inverse Operators in Dynamic Epistemic Logic. 217-235 - Dag Normann, Sam Sanders:
Betwixt Turing and Kleene. 236-252 - Iosif Petrakis:
Computability Models over Categories and Presheaves. 253-265 - Daniel Rogozin:
Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability. 266-280 - Sam Sanders:
Between Turing and Kleene. 281-300 - Igor Sedlár:
Propositional Dynamic Logic with Quantification over Regular Computation Sequences. 301-315 - Rick Statman:
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic. 316-326 - K. Subramani, Piotr Wojciechowski:
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. 327-345 - Davide Trotta, Matteo Spadetto, Valeria de Paiva:
Dialectica Logical Principles. 346-363 - Maciej Zielenkiewicz:
Small Model Property Reflects in Games and Automata. 364-375
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-10-04 19:48 CEST 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:
