Logic, Language, Information, and Computation. 28th International Workshop, WoLLIC 2022 Iași, Romania, September 20–23, 2022 Proceedings

Description

Preface Organization Invited Talks On the Proof Theoretic Strength of Circular Reasoning Open Texture and Defeasible Semantic Constraint \partial is for Dialectica How to Define Domain Specific Logics using Matching Logic The Value of Normal Derivations in the Realm of Explanations Tutorials Cardinalities, Infinities and Choice Principles for Finitely Supported Sets Intuitionistic Modal Proof Theory Automating Moral Reasoning Contents A Proof of the Focusing Theorem via MALL Proof Nets 1 Introduction 2 The MALL Fragment of Linear Logic 3 Proof Structures 4 Conclusions References Time and Gödel: Fuzzy Temporal Reasoning in PSPACE 1 Introduction 2 Syntax and Semantics 3 Real-Valued Versus Bi-relational Validity 4 Labelled Systems and Quasimodels 5 From Quasimodels to Bi-relational Models 6 From Bi-relational Models to Finite Quasimodels 7 PSPACE Completeness 8 Concluding Remarks References Fixed Point Logics and Definable Topological Properties 1 Introduction 2 Background 3 Classes Defined by Greatest Fixed Points 4 Completeness for Imperfect Spaces 5 Conclusion References Correspondence Theory for Generalized Modal Algebras 1 Introduction 2 Preliminaries 2.1 Generalized Boolean Algebras 2.2 Generalized Stone Spaces 2.3 Topological Duality Between Generalized Boolean Algebras and Generalized Stone Spaces 2.4 Adding Modality 2.5 Some Useful Propositions 3 Syntax and Semantics 3.1 Language and Syntax 3.2 Semantics 4 Preliminaries on Algorithmic Correspondence 4.1 The Expanded Language 4.2 The First-Order Correspondence Language and the Standard Translation 5 Inductive Inequalities for Generalized Modal Algebras 6 Algorithm 7 Success of ALBA 8 Soundness of ALBA 9 Right-Handed Topological Ackermann Lemma 9.1 Analysis of the Right-Handed Ackermann Rule 9.2 Proof of Topological Ackermann Lemma 10 Example 11 Concluding Remarks References Tense Logics over Lattices 1 Introduction 2 Preliminaries 2.1 Tense Logic 2.2 Step-by-Step Method 2.3 Lattices 3 TL over Lattices w.r.t.