Related papers: Grzegorczyk Logic Unlocked
The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data…
The finite model property of quasi-transitive modal logic $\mathsf{K}_2^3=\mathsf{K}\oplus \Box\Box p\rightarrow \Box\Box\Box p$ is established. This modal logic is conservatively extended to the tense logic $\mathsf{Kt}_2^3$. We present a…
Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…
We give a complete description of quadratic potential and twisted potential algebras on 3 generators as well as cubic potential and twisted potential algebras on 2 generators up to graded algebra isomorphisms under the assumption that the…
Brzozowski derivatives of a regular expression are developed for constructing deterministic automata from the given regular expression in the algebraic way. In this paper,some lemmas of the regular expressions are discussed and the regular…
Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be…
The objective of this paper is to describe the structure of Zariski closed algebras, which provide a useful generalization to finite dimensional algebras in the study of representable algebras over finite fields. Our results include a…
This comparative survey explores three formal approaches to reasoning with partly true statements and degrees of truth, within the family of {\L}ukasiewicz logic. These approaches are represented by infinite-valued {\L}ukasiewicz logic…
The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…
We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…
Existential rules, a.k.a. dependencies in databases, and Datalog+/- in knowledge representation and reasoning recently, are a family of important logical languages widely used in computer science and artificial intelligence. Towards a deep…
A natural geometric framework is proposed, based on ideas of W. M. Tulczyjew, for constructions of dynamics on general algebroids. One obtains formalisms similar to the Lagrangian and the Hamiltonian ones. In contrast with recently studied…
Plonka sums consist of an algebraic construction similar, in some sense to direct limits, which allows to represent classes of algebras defined by means of regular identities (namely those equations where the same set of variables appears…
Continuous logic extends the multi-valued Lukasiewicz logic by adding a halving operator on propositions. This extension is designed to give a more satisfactory model theory for continuous structures. The semantics of these logics can be…
In this paper, we present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Goedel and Rosser, respectively. We prove the cut-elimination theorem for the calculus.
The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of…
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…