English
Related papers

Related papers: The Topological Mu-Calculus: completeness and deci…

200 papers

In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types…

Disordered Systems and Neural Networks · Physics 2019-11-12 Shi-Xin Zhang

We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…

Logic · Mathematics 2026-04-14 Jim de Groot , Ian Shillito , Ranald Clouston

In this note, we investigate the algebraic and topological representation theory of cylindric ortholattices and cylindric Boolean algebras. The first contribution demonstrates that cylindric ortholattices are closed under canonical…

Logic · Mathematics 2025-07-24 Joseph McDonald

The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…

Logic in Computer Science · Computer Science 2023-06-22 Frédéric Blanqui , Gilles Dowek , Emilie Grienenberger , Gabriel Hondet , François Thiré

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

We classify the propositional modal validities arising from the category of sets under its natural classes of morphisms. The resulting validities depend on the morphism class, the size of the world, and the permitted substitution instances.…

Logic · Mathematics 2026-04-29 Wojciech Aleksander Wołoszyn

Logical relations and their generalizations are a fundamental tool in proving properties of lambda-calculi, e.g., yielding sound principles for observational equivalence. We propose a natural notion of logical relations able to deal with…

Logic in Computer Science · Computer Science 2009-09-29 Jean Goubault-Larrecq , Slawomir Lasota , David Nowak

A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…

Logic in Computer Science · Computer Science 2025-11-14 Kenji Tokuo

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

Machine Learning · Computer Science 2017-08-01 Konstantin Genin , Kevin T. Kelly

We define a notion of model for the $\lambda$$\Pi$-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the $\lambda$$\Pi$-calculus modulo any…

Logic in Computer Science · Computer Science 2017-04-28 Gilles Dowek

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

Logic in Computer Science · Computer Science 2013-01-07 Zhaohua Luo

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

Computability logic is a formal theory of computability. The earlier article "Introduction to cirquent calculus and abstract resource semantics" by Japaridze proved soundness and completeness for the basic fragment CL5 of computability…

Logic in Computer Science · Computer Science 2011-06-14 Wenyan Xu , Sanyang Liu

The paper presents algebraic and logical developments. From the algebraic viewpoint, we introduce Monadic Equational Systems as an abstract enriched notion of equational presentation. From the logical viewpoint, we provide Equational…

Category Theory · Mathematics 2013-09-20 Marcelo Fiore

There are many different semantics for general logic programs (i.e. programs that use negation in the bodies of clauses). Most of these semantics are Turing complete (in a sense that can be made precise), implying that they are undecidable.…

Logic in Computer Science · Computer Science 2015-07-15 Levon Haykazyan

This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…

Logic in Computer Science · Computer Science 2015-07-01 Robert Rettinger , Klaus Weihrauch

We construct a new topology on the space of stopped paths and introduce a calculus for causal functionals on generic domains of this space. We propose a generic approach to pathwise integration without any assumption on the variation index…

Probability · Mathematics 2022-08-23 Henry Chiu , Rama Cont

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

Logic · Mathematics 2024-12-23 Lorna Gregory

In this note we will show a Calder\'on--Zygmund decomposition associated with a function $f\in L^1(\mathbb{T}^{\omega})$. The idea relies on an adaptation of a more general result by J. L. Rubio de Francia in the setting of locally compact…

Classical Analysis and ODEs · Mathematics 2020-01-07 E. Fernández , L. Roncal

This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…

Number Theory · Mathematics 2016-08-08 Timothy Redmond , Charles Ryavec