Results 31 to 40 of about 690 (186)
Substructure Temporal Logic [PDF]
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013 In formal verification and design, reasoning about substructures is a crucial aspect for several fundamental problems, whose solution often requires to select a portion of the model of interest on which to verify a specific property. In this paper, we present a new branching-time temporal logic, called Substructure Temporal Logic (STL, for short ...
BENERECETTI, MASSIMO +2 more
openaire +2 more sources
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Bulletin of the Section of Logic, 2021 Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj +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
Local Search and the Evolution of World Models
Topics in Cognitive Science, EarlyView., 2023 Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley +3 more
wiley +1 more source
Outline of a Dialogical Theory of Truth
Crítica, 2023 In this essay I propose two theories of truth and show how they deal with semantic paradoxes. Their most salient feature is that they are based on a gametheoretic understanding of logic and meaning.
Miguel Álvarez Lisboa
doaj +1 more source
Duality Theory and Categorical Universal Logic: With Emphasis on Quantum Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical, intuitionistic, and ...
Yoshihiro Maruyama
doaj +1 more source
Amortised resource analysis with separation logic [PDF]
, 2010 Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete ...
Robert Atkey, Atkey, Robert
core +1 more source
Stone-Type Dualities for Separation Logics [PDF]
Logical Methods in Computer Science, 2019 Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence, yielding a ...
Simon Docherty, David Pym
doaj +1 more source
Dynamic Separation Logic and its Use in Education
Современные информационные технологии и IT-образование, 2020 Mathematical logic is widely used in hardware and software verification. Hoare logic is particularly suitable for reasoning about imperative programs.
Evgeny Makarov
doaj +1 more source
Remarks on an algebraic semantics for paraconsistent Nelson's logic
Manuscrito, 2011 In the paper Busaniche and Cignoli (2009) we presented a quasivariety of commutative residuated lattices, called NPc-lattices, that serves as an algebraic semantics for paraconsistent Nelson's logic.
Manuela Busaniche, Roberto Cignoli
doaj +1 more source