Results 1 to 10 of about 210 (36)
Duality for powerset coalgebras [PDF]
Logical Methods in Computer Science, 2022 Let CABA be the category of complete and atomic boolean algebras and complete boolean homomorphisms, and let CSL be the category of complete meet-semilattices and complete meet-homomorphisms. We show that the forgetful functor from CABA to CSL has a left
Guram Bezhanishvili +2 more
doaj +1 more source
Modal Functional (Dialectica) Interpretation [PDF]
Logical Methods in Computer Science, 2021 We adapt our light Dialectica interpretation to usual and light modal formulas (with universal quantification on boolean and natural variables) and prove it sound for a non-standard modal arithmetic based on Goedel's T and classical S4. The range of this
Dan Hernest, Trifon Trifonov
doaj +1 more source
Constructive Canonicity of Inductive Inequalities [PDF]
Logical Methods in Computer Science, 2020 We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of logics algebraically captured by varieties of normal and regular lattice expansions.
Willem Conradie, Alessandra Palmigiano
doaj +1 more source
Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions [PDF]
Logical Methods in Computer Science, 2022 In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states than two-valued notions of behavioural equivalence or behaviour inclusion.
Paul Wild, Lutz Schröder
doaj +1 more source
Sahlqvist via Translation [PDF]
Logical Methods in Computer Science, 2019 In recent years, unified correspondence has been developed as a generalized Sahlqvist theory which applies uniformly to all signatures of normal and regular (distributive) lattice expansions.
Willem Conradie +2 more
doaj +1 more source
Canonical Models and the Complexity of Modal Team Logic [PDF]
Logical Methods in Computer Science, 2019 We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood.
Martin Lück
doaj +1 more source
$\aleph_1$ and the modal $\mu$-calculus [PDF]
Logical Methods in Computer Science, 2019 For a regular cardinal $\kappa$, a formula of the modal $\mu$-calculus is $\kappa$-continuous in a variable x if, on every model, its interpretation as a unary function of x is monotone and preserves unions of $\kappa$-directed sets.
Maria João Gouveia, Luigi Santocanale
doaj +1 more source
MacNeille completion and profinite completion can coincide on finitely generated modal algebras [PDF]
, 2008 Following Bezhanishvili & Vosmaer, we confirm a conjecture of Yde Venema by piecing together results from various authors. Specifically, we show that if $\mathbb{A}$ is a residually finite, finitely generated modal algebra such that $\operatorname{HSP ...
Vosmaer, Jacob
core +5 more sources
The modal logic of Reverse Mathematics [PDF]
, 2014 The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way.
Mummert, Carl +2 more
core +1 more source
Ingeniería y Ciencia, 2012 Se presenta como extensión del cálculo proposicional clásico, el sistema deductivo LT: lógica de las tautologías. En el sistema LT, se formalizan las nociones meta-lógicas de tautología, contradicción, satisfacible, refutable y contingencia.
Manuel Sierra A.
doaj +1 more source