![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
LFCS 2020: Deerfield Beach, FL, USA
- Sergei N. Artëmov
, Anil Nerode:
Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings. Lecture Notes in Computer Science 11972, Springer 2020, ISBN 978-3-030-36754-1 - Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
Computability of Algebraic and Definable Closure. 1-11 - Sergei N. Artëmov
:
Observable Models. 12-26 - Tiziano Dalmonte
, Björn Lellmann
, Nicola Olivetti
, Elaine Pimentel
:
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics. 27-46 - Yannick Forster
, Dominik Kirst
, Dominik Wehr
:
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory. 47-74 - Hirohiko Kushida:
On the Constructive Truth and Falsity in Peano Arithmetic. 75-84 - Eveline Lehmann
, Thomas Studer
:
Belief Expansion in Subset Models. 85-97 - Daniel Leivant
:
Finitism, Imperative Programs and Primitive Recursion. 98-110 - Yanhong A. Liu, Scott D. Stoller:
Knowledge of Uncertain Worlds: Programming with Logical Constraints. 111-127 - Matthias Baaz
, Anela Lolic
:
A Globally Sound Analytic Calculus for Henkin Quantifiers. 128-143 - Robert S. Lubarsky:
Feedback Hyperjump. 144-155 - Tim Lyon
:
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents. 156-176 - Tim Lyon
:
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems. 177-194 - Yasir Mahmood
, Arne Meier
, Johannes Schmidt
:
Parameterised Complexity of Abduction in Schaefer's Framework. 195-213 - Diogo Poças
, Jeffery I. Zucker:
Tracking Computability of GPAC-Generable Functions. 214-235 - Daniel Rogozin
:
Modal Type Theory Based on the Intuitionistic Modal Logic $\mathbf{IEL}^{-}$. 236-248 - Sam Sanders
:
Lifting Recursive Counterexamples to Higher-Order Arithmetic. 249-267 - Dan E. Willard:
On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction. 268-286
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.