E-Books durchsuchen
Logical Foundations of Computer Science [2021]
- 1
-
A Non-hyperarithmetical Gödel Logic
- 2
-
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily
- 3
-
The Isomorphism Problem for FST Injection Structures
- 4
-
Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic
- 5
-
Hyperarithmetical Worm Battles
- 6
-
Parametric Church’s Thesis: Synthetic Computability Without Choice
- 7
-
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
- 8
-
A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance
- 9
-
A Parameterized View on the Complexity of Dependence Logic
- 10
-
A Logic of Interactive Proofs
- 11
-
Recursive Rules with Aggregation: A Simple Unified Semantics
- 12
-
Computational Properties of Partial Non-deterministic Matrices and Their Logics
- 13
-
Soundness and Completeness Results for LEA and Probability Semantics
- 14
-
On Inverse Operators in Dynamic Epistemic Logic
- 15
-
Betwixt Turing and Kleene
- 16
-
Computability Models over Categories and Presheaves
- 17
-
Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability
- 18
-
Between Turing and Kleene
- 19
-
Propositional Dynamic Logic with Quantification over Regular Computation Sequences
- 20
-
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic
- 21
-
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems
- 22
-
Dialectica Logical Principles
- 23
-
Small Model Property Reflects in Games and Automata