中文
相关论文

相关论文: Um modelo alg\'ebrico do quantificador da Ubiquida…

200 篇论文

We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…

量子物理 · 物理学 2016-09-19 Mladen Pavicic

A semantic embedding of (constant domain) quantified conditional logic in classical higher-order logic is presented.

人工智能 · 计算机科学 2012-04-27 Christoph Benzmueller , Valerio Genovese

We give a short appreciation of Mumford's work on the moduli of varieties by putting it into historical context. By reviewing earlier works we highlight the innovations introduced by Mumford. Then we discuss recent developments whose…

代数几何 · 数学 2018-10-01 János Kollár

In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…

计算机科学中的逻辑 · 计算机科学 2019-12-06 Alejandro Díaz-Caro , Mauricio Guillermo , Alexandre Miquel , Benoît Valiron

We investigate commutator operations on compatible uniformities of an algebra. We present a commutator operation for compatible uniformities of an algebra in a congruence-modular variety which extends the commutator on congruences, and…

环与代数 · 数学 2007-05-23 William H. Rowan

There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…

计算机科学中的逻辑 · 计算机科学 2023-06-16 Oliver Görlitz , Daniel Hausmann , Merlin Humml , Dirk Pattinson , Simon Prucker , Lutz Schröder

We advocate the use of de Bruijn's universal abstraction $\lambda^\infty$ for the quantification of schematic variables in the predicative setting and we present a typed $\lambda$-calculus featuring the quantifier $\lambda^\infty$…

计算机科学中的逻辑 · 计算机科学 2021-05-11 Ferruccio Guidi

In this paper, a new approximate syllogistic reasoning schema is described that expands some of the approaches expounded in the literature into two ways: (i) a number of different types of quantifiers (logical, absolute, proportional,…

人工智能 · 计算机科学 2014-11-27 M. Pereira-Fariña , Juan C. Vidal , F. Díaz-Hermida , A. Bugarín

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

人工智能 · 计算机科学 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…

量子物理 · 物理学 2026-02-19 Olivier Brunet

Implicative algebras have been recently introduced by Miquel in order to provide a unifying notion of model, encompassing the most relevant and used ones, such as realizability (both classical and intuitionistic), and forcing. In this work,…

范畴论 · 数学 2023-12-06 Samuele Maschio , Davide Trotta

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

计算机科学中的逻辑 · 计算机科学 2016-08-31 Gopalan Nadathur

Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…

逻辑 · 数学 2026-02-11 Sam van Gool

This paper is about the computability of the modal definability problem in classes of frames determined by Euclidean modal logics. We characterize those Euclidean modal logics such that the classes of frames they determine give rise to an…

计算机科学中的逻辑 · 计算机科学 2025-08-15 Philippe Balbiani , Tinko Tinchev

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

计算机科学中的逻辑 · 计算机科学 2009-02-13 Lutz Schröder , Dirk Pattinson

A holistic extension of classical propositional logic is introduced in the framework of quantum computation with mixed states. The concepts of tautology and contradiction are investigated in this extensions. A special family of quantum…

量子物理 · 物理学 2019-04-10 H. Freytes , R. Giuntini , G. Sergioli

Niels Bohr introduced the concept of complementarity in order to give a general account of quantum mechanics, however he stressed that the idea of complementarity is related to the general dificulty in the formation of human ideas, inherent…

量子物理 · 物理学 2007-05-29 Christian de Ronde

We assume that M is a phase space and H an Hilbert space yielded by a quantization scheme. In this paper we consider the set of all "experimental propositions" of M and we look for a model of quantum logic in relation to the quantization of…

数学物理 · 物理学 2017-04-14 Simone Camosso

We present a way to apply quantum logic to the study of quantum programs. This is made possible by using an extension of the usual propositional language in order to make transformations performed on the system appear explicitly. This way,…

量子物理 · 物理学 2007-05-23 Olivier Brunet , Philippe Jorrand

We explore a simple approach to quantum logic based on hybrid and dynamic modal logic, where the set of states is given by some Hilbert space. In this setting, a notion of quantum clause is proposed in a similar way the notion of Horn…

计算机科学中的逻辑 · 计算机科学 2024-06-21 Daniel Gaina