Results 21 to 30 of about 716,706 (268)
Complete Representations and Neat Embeddings
Bulletin of the Section of Logic, 2022 Let ...
Tarek Sayed Ahmed
doaj +1 more source
The Modelwise Interpolation Property of Semantic Logics
Bulletin of the Section of Logic, 2023 In this paper we introduce the modelwise interpolation property of a logic that states that whenever \(\models\phi\to\psi\) holds for two formulas \(\phi\) and \(\psi\), then for every model \(\mathfrak{M}\) there is an interpolant formula \(\chi ...
Zalán Gyenis +2 more
doaj +1 more source
Intuitionistic quantum logic of an n-level system [PDF]
, 2009 A decade ago, Isham and Butterfield proposed a topos theoretic approach to quantum mechanics, which meanwhile has been extended by Doering and Isham so as to provide a new mathematical foundation for all of physics.
Landsman, N.P. +19 more
core +2 more sources
Algebraic theories for contextual pre-nets
, 2003 The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors that must be somewhat filtered out.
Meseguer, J. +7 more
core +2 more sources
Conversion between Logic and Algebraic Expressions of Boolean Control Networks
Applied Sciences, 2020 The conversion between logic and algebraic expressions of Boolean control networks plays a worthy role in the analysis and design of digital circuits. In this paper, for a single Boolean function, a direct conversion between the minterm canonical form ...
Cailu Wang, Yuegang Tao
doaj +1 more source
A Logic for Algebraic Effects [PDF]
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008 We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the a-calculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation.
Gordon D. Plotkin, Matija Pretnar
openaire +3 more sources
Relational and Allegorical Semantics for Constraint Logic Programming [PDF]
, 2012 El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de
Gallego Arias, Emilio Jesús
core +1 more source
Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]
Logical Methods in Computer Science, 2013 The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the ...
Thomas Colcombet
doaj +1 more source
Features and Fluents for Logic Programming: Non-simulative Algebraic Semantics [PDF]
, 2013 A Non-simulative Algebraic Semantics is defined and its range of applicability is proven to be the K-RACi class of the Features and Fluents framework.
Brandano, Sergio
core +1 more source
Intuitionistic Layered Graph Logic: Semantics and Proof Theory [PDF]
Logical Methods in Computer Science, 2018 Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature.
Simon Docherty, David Pym
doaj +1 more source