相关论文: Bounded Linear Logic, Revisited

In arXiv: math.LO/0011208 we proposed the {\sl intuitionistic or disjunctive representation of quantum logic}, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these…

In this paper, we see several basic properties of graded linear series. We firstly see that, if a graded linear series contains an ample series, then so are the pullbacks of the system under birational morphisms. Using this proposition, we…

Linearized deformations of the thick-walled (low-amplitude) (1+1)-dimensional Q-ball may be decomposed into relativistic modes, which are roughly plane waves, and also long-wavelength corotating and counterrotating Floquet modes. Each mode…

The optimal adaptive control of a linear system in a signal-plus-noise setting with infinite horizon LQ regulator cost is studied. The class of partially observed linear systems for which the certainty equivalence property holds is…

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

We discuss constraint structure of extended theories of gravitation (also known as f(R) theories) in the vacuum selfdual formulation introduced in ref. [1].

We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and…

We introduce and investigate a weighted propositional configuration logic over commutative semirings. Our logic is intended to serve as a specification language for software architectures with quantitative features. We prove an efficient…

Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming…

This paper presents State Algebra, a novel framework designed to represent and manipulate propositional logic using algebraic methods. The framework is structured as a hierarchy of three representations: Set, Coordinate, and Row…

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

We briefly review a perspective along which the Boltzmann-Gibbs statistical mechanics, the strongly chaotic dynamical systems, and the Schroedinger, Klein-Gordon and Dirac partial differential equations are seen as linear physics, and are…

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

This study presents an innovative enhancement to retrieval-augmented generation (RAG) systems by seamlessly integrating fine-tuned large language models (LLMs) with vector databases. This integration capitalizes on the combined strengths of…

Quantum deep learning (QDL) explores the use of both quantum and quantum-inspired resources to determine when deep learning's core capabilities, such as expressivity, generalization, and scalability, can be enhanced based on specific…

We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an asynchronous and a…

Standpoint linear temporal logic ($SLTL$) is a recently introduced extension of classical linear temporal logic ($LTL$) with standpoint modalities. Intuitively, these modalities allow to express that, from agent $a$'s standpoint, it is…

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

Exponential parallelism, a defining principle of advanced computational systems, holds promise for transformative impacts across several scientific and industrial domains. This feature paper provides a comparative overview of Quantum…

In the present paper syntax and semantics will be presented for an expansion of ordinary n-agent QML with constant domain, non-rigid constants, rigid variables and including both functions, relations, and equality. Further, the number of…