
Inhaltsverzeichnis
Computability of Algebraic and Definable Closure. - Observable Models. - Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics. - Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory. - On the Constructive Truth and Falsity in Peano Arithmetic. - Belief Expansion in Subset Models. - Finitism, Concrete Programs and Primitive Recursion. - Knowledge of Uncertain Worlds: Programming with Logical Constraints. - A Globally Sound Analytic Calculus for Henkin Quantifiers. - Feedback Hyperjump. - Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents. - On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems. - Parameterised Complexity of Abduction in Schaefer' s Framework. - Tracking Computability of GPAC-Generable Functions. - Modal Type Theory Based on the Intuitionistic Modal Logic ! . - Lifting Recursive Counterexamples to Higher-Order Arithmetic. - On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction.
Es wurden noch keine Bewertungen abgegeben. Schreiben Sie die erste Bewertung zu "Logical Foundations of Computer Science" und helfen Sie damit anderen bei der Kaufentscheidung.