English
Related papers

Related papers: Homotopies in Classical and Paraconsistent Modal L…

200 papers

The concept of paradeduction is presented in order to justify that we can overlook contradictory information taking into account only what is consistent. Besides that, paradeduction is used to show that there is a way to transform any…

Logic · Mathematics 2022-07-13 Edelcio G. de Souza , Alexandre Costa-Leite , Diogo H. B. Dias

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

We introduce a new family of temporal logics designed to finely balance the trade-off between expressivity and complexity. Their key feature is the possibility of defining operators of a new kind that we call transformation operators. Some…

Logic in Computer Science · Computer Science 2024-09-09 Alessandro Ronca

Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming constructs. However, it still remains a challenge to provide a…

Logic in Computer Science · Computer Science 2018-04-13 Fredrik Dahlqvist , Renato Neves

Classical limits of quantum systems are shown to lead to different conceptions of spaces different from the classical one underlying the process of quantization of such systems. The accent is put in situations where traces of…

Quantum Physics · Physics 2022-07-22 Thierry Paul

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…

Logic · Mathematics 2013-07-01 Steve Awodey , Henrik Forssell

A paraconsistent type theory (an extension of a fragment of intuitionistic type theory by adding opposite types) is here extended by adding co-function types. It is shown that, in the extended paraconsistent type system, the opposite type…

Logic in Computer Science · Computer Science 2022-04-11 Juan C. Agudelo-Agudelo , Andrés Sicard-Ramírez

Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

The recapture relationship is an important element to any understanding of the connexion between different systems of logic. Loosely speaking, one system of logic recaptures another if it is possible to specify a subsystem of the former…

Logic · Mathematics 2007-05-23 Andrew Aberdein

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…

We study generically stable types/measures in both classical and continuous logics, and their connection with randomization and modes of convergence of types/measures.

Logic · Mathematics 2025-08-27 Karim Khanaki

It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…

Logic · Mathematics 2007-06-13 Dmitry Sustretov

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

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…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

The expansion of a classical Hamilton formalism consisting in adaptation of it to describe the nonequilibrium systems is offered. Expansion is obtained by construction of formalism on the basis of the dynamics equation of the equilibrium…

Classical Physics · Physics 2007-05-23 V. M. Somsikov

This paper is focused on the development of the notions of canonical and canonoid transformations within the framework of Hamiltonian Mechanics on locally conformal symplectic manifolds. Both, time-independent and time-dependent dynamics…

Mathematical Physics · Physics 2025-09-16 Rafael Azuaje , Xuefeng Zhao

Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both…

Logic in Computer Science · Computer Science 2017-04-25 Lauri Hella , Antti Kuusisto , Arne Meier , Jonni Virtema

In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a…

Logic · Mathematics 2024-05-14 Wesley H. Holliday

The paper analyzes dynamic epistemic logic from a topological perspective. The main contribution consists of a framework in which dynamic epistemic logic satisfies the requirements for being a topological dynamical system thus interfacing…

Logic in Computer Science · Computer Science 2017-09-05 Dominik Klein , Rasmus K. Rendsvig