LFCS

Keyphrases

Publications

2022

Christian Hagemeier, Dominik Kirst
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic. LFCS (2022)
Shota Motoura, Shin-ya Katsumata
On Inverse Operators in Dynamic Epistemic Logic. LFCS (2022)
David Fernández-Duque, Konstnatinos Papafilippou, Joost J. Joosten
Hyperarithmetical Worm Battles. LFCS (2022)
K. Subramani, Piotr J. Wojciechowski
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. LFCS (2022)
Juha Kontinen, Arne Meier, Yasir Mahmood
A Parameterized View on the Complexity of Dependence Logic. LFCS (2022)
Sérgio Marcelino, Carlos Caleiro, Pedro Filipe
Computational Properties of Partial Non-deterministic Matrices and Their Logics. LFCS (2022)
Eoin Moore
Soundness and Completeness Results for LEA and Probability Semantics. LFCS (2022)
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. LFCS (2022)
Dag Normann, Sam Sanders
Betwixt Turing and Kleene. LFCS (2022)
Iosif Petrakis
Computability Models over Categories and Presheaves. LFCS (2022)
Igor Sedlár
Propositional Dynamic Logic with Quantification over Regular Computation Sequences. LFCS (2022)
Juan P. Aguilera, Jan Bydzovsky, David Fernández-Duque
A Non-hyperarithmetical Gödel Logic. LFCS (2022)
David Lehnherr, Zoran Ognjanovic, Thomas Studer
A Logic of Interactive Proofs. LFCS (2022)
Matthias Baaz, Anela Lolic
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily. LFCS (2022)
Sam Sanders
Between Turing and Kleene. LFCS (2022)
Daniel Rogozin
Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability. LFCS (2022)
Douglas Cenzer, Richard Krogman
The Isomorphism Problem for FST Injection Structures. LFCS (2022)
Davide Trotta, Matteo Spadetto, Valeria de Paiva
Dialectica Logical Principles. LFCS (2022)
Maciej Zielenkiewicz
Small Model Property Reflects in Games and Automata. LFCS (2022)
Yannick Forster
Parametric Church's Thesis: Synthetic Computability Without Choice. LFCS (2022)
Rick Statman
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic. LFCS (2022)
Yanhong A. Liu, Scott D. Stoller
Recursive Rules with Aggregation: A Simple Unified Semantics. LFCS (2022)
Neil J. DeBoer
Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic. LFCS (2022)

volume 13137, 2022

Logical Foundations of Computer Science - International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings LFCS 13137 (2022)

2020

volume 11972, 2020

Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings LFCS 11972 (2020)

2018

volume 10703, 2018

Logical Foundations of Computer Science - International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings LFCS 10703 (2018)