English
Related papers

Related papers: Modal-type orthomodular logic

200 papers

We present modular implicits, an extension to the OCaml language for ad-hoc polymorphism inspired by Scala implicits and modular type classes. Modular implicits are based on type-directed implicit module parameters, and elaborate…

Programming Languages · Computer Science 2015-12-08 Leo White , Frédéric Bour , Jeremy Yallop

We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…

Logic · Mathematics 2011-10-12 Xavier Caicedo , Ricardo Oscar Rodriguez

I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn

We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a proof-theoretic soundness and completeness proof, which we…

Logic in Computer Science · Computer Science 2022-04-28 Robert Rothenberg

It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be…

Artificial Intelligence · Computer Science 2007-05-23 Joost Vennekens , David Gilis , Marc Denecker

Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of the present paper in order to establish a useful tool for studying the logic of quantum mechanics. They investigated structural…

Logic · Mathematics 2020-09-14 Ivan Chajda , Helmut Länger

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

Polyhedral semantics is a recently introduced branch of spatial modal logic, in which modal formulas are interpreted as piecewise linear subsets of an Euclidean space. Polyhedral semantics for the basic modal language has already been well…

Logic in Computer Science · Computer Science 2024-06-25 Nick Bezhanishvili , Laura Bussi , Vincenzo Ciancia , David Fernández-Duque , David Gabelaia

The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics.…

Category Theory · Mathematics 2022-11-04 Robin Cockett , Priyaa Varshinee Srinivasan

We study a variant of the modal $\mu$-calculus based on the constructive modal logic $\mathsf{CK}$. We define game semantics for the constructive $\mu$-calculus and prove its equivalence to the birelational Kripke semantics. We then use the…

Logic in Computer Science · Computer Science 2026-04-28 Leonardo Pacheco

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz

Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions…

Quantum Physics · Physics 2014-12-31 Daniel Marsden

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

Logic in Computer Science · Computer Science 2021-12-15 Yannick Forster , Dominik Kirst , Dominik Wehr

Under the Curry--Howard isomorphism, the syntactic structure of programs can be modeled using birelational Kripke structures equipped with intuitionistic and modal relations. Intuitionistic relations capture scoping through persistence,…

Logic in Computer Science · Computer Science 2026-02-11 Yuito Murase , Akinori Maniwa

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

Logic · Mathematics 2020-08-12 Robert Goldblatt , Ian Hodkinson

Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning. In recent years, quantitative variants of modal…

Logic in Computer Science · Computer Science 2013-06-13 Tingting Han , Christian Krause , Marta Kwiatkowska , Holger Giese

We determine the modal logic of fixed-point models of truth and their axiomatizations by Solomon Feferman via Solovay-style completeness results. Given a fixed-point model $\mathcal{M}$, or an axiomatization $S$ thereof, we find a modal…

Logic · Mathematics 2020-10-28 Carlo Nicolai , Johannes Stern

Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. Orthomodular logic is shown to be a nonlinear noncommutative logic. Sequents are given a physically motivated semantics that is consistent with…

Logic · Mathematics 2024-11-20 Andre Kornell

We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended…

Logic in Computer Science · Computer Science 2014-06-25 Lauri Hella , Kerkko Luosto , Katsuhiko Sano , Jonni Virtema

The updated version of this paper has already been published in The Australasian Journal of Logic. You can access to the paper from the following link: https://ojs.victoria.ac.nz/ajl/article/view/7696. This paper shows Hilbert system…

Logic in Computer Science · Computer Science 2023-12-27 Masanobu Toyooka , Katsuhiko Sano
‹ Prev 1 3 4 5 6 7 10 Next ›