Logic, Language, Information, and Computation (eBook, PDF)

31st International Workshop, WoLLIC 2025, Porto, Portugal, July 14-17, 2025, Proceedings
Redaktion: Kozen, Dexter; De Queiroz, Ruy

• Format: PDF

Produktbeschreibung

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 31st International Workshop on Logic, Language, Information, and Computation, WoLLIC 2025, in Porto, Portugal, during July 2025.

The 21 full papers included in this book were carefully reviewed and selected from 57 submissions. The WoLLIC conference aim of fostering interdisciplinary research in pure and applied logic.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Nature Switzerland
• Seitenzahl: 369
• Erscheinungstermin: 31. Juli 2025
• Englisch
• ISBN-13: 9783031995361
• Artikelnr.: 75060383

Inhaltsangabe

.- Deep Induction for Inductive Families
.- Asymptotic Reasoning with Two Variables Asymptotic Reasoning with Two Variables.
.- Logics of Importation and Exportation for the Implicative Conditional.
.- Paraconsistent Constructive Modal Logic.
.- . Convergence laws for expansions of linear preorders.
.- Indicative conditionals: algebraic considerations.
.- Abstracting Conceptual Models as a Weakening Process.
.- . Axiomatization and Decidability of Tense Information Logic.
.- Infinitary Refinement Types for Temporal Properties in Scott Domains.
.- On tame semantics for interpretability logic.
.- Constructive Modal Logics: Bi-nested Calculi and Bi-relational Countermodels.
.- Insensitive Games: Game Semantics for Modal Insensitivity.
.- . Index set complexity for congruence lattices of lattices.
.- The Satisfiability Problem in a Separation Logic of Relations.
.- Graded Relation Updates in Modal Logic.
.- Proof Search in Classical Propositional Logic with Partial Proof Terms.
.- A significance-based account of ceteris paribus counterfactuals.
.- Tabular intermediate logics comparison.
.- Insignificant Choice Polynomial Time -- A Logic Capturing PTIME.
.- Counterexamples to Import-Export in Conditionals: A Logical Analysis.