Intro
Preface
Organization
Contents
A Non-hyperarithmetical Gödel Logic
1 Introduction
2 Preliminaries
3 Standard Models via Vagueness
4 Satisfiability in G""3223379
5 Validity in G""3223379
6 Concluding Remarks
References
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily
1 Introduction
2 The Sequent Calculi LK, LK+ and LK++
3 Skolemization and Deskolemization
4 Cut-Free LK-Proofs with Weak Quantifiers and Resolution
5 Andrews Skolemizations Allows for Non-elementarily Shorter Resolution Refutations
6 Conclusion

3 Arithmetical Soundness of GLP
4 Worm Battles Outside PA
4.1 The Reduction Property
4.2 From 1-consistency to the Worm Principle
4.3 From the Worm Principle to 1-consistency
5 Concluding Remarks
References
Parametric Church's Thesis: Synthetic Computability Without Choice
1 Preliminaries
1.1 Common Definitions in CIC
1.2 Partial Functions
1.3 The Universe of Propositions P, Elimination, and Choice Principles
1.4 Notions of Synthetic Computability
2 Church's Thesis
3 Synthetic Church's Thesis
4 Variations of Synthetic Church's Thesis

5 The Enumerability Axiom
6 Rice's Theorem
7 [def:CT]CT in the Weak Call-by-Value -Calculus
8 Related Work
A Consistency and Admissibility of CT in CIC
References
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
1 Introduction
2 Preliminaries
3 Basic Intuitionistic Epistemic Logic
4 Cut-Free Sequent Calculus
5 Decidability via Proof Search
6 Constructive Completeness
6.1 Lindenbaum Extension
6.2 Canonical Models
6.3 Finite Model Property
6.4 Semantic Cut-Elimination
7 Completeness for Infinite Theories

7.1 Arbitrary Theories
7.2 Enumerable Theories
8 Conclusion
8.1 Related Work
8.2 Future Work
1 Natural Deduction System for IEL
2 Coq Mechanisation
2.1 The Classical Modal Logic K
2.2 Height-Encoding
3 Cut-Elimination: Selected Cases
References
A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance
1 Introduction
2 Results
3 Application to Phylogeny
4 Conclusion
References
A Parameterized View on the Complexity of Dependence Logic
1 Introduction
2 Preliminaries