English
Related papers

Related papers: Implicative models of set theory

200 papers

There is growing interest in the study of causal methods in the Earth sciences. However, most applications have focused on causal discovery, i.e. inferring the causal relationships and causal structure from data. This paper instead examines…

Atmospheric and Oceanic Physics · Physics 2021-05-04 Adam Massmann , Pierre Gentine , Jakob Runge

The collection of open sets of a topological space forms a Heyting algebra, which leads to the idea of a Heyting algebra as a generalized topological space. In fact, a sober topological space may be reconstructed from its locale of open…

Category Theory · Mathematics 2021-02-08 Abhishek Banerjee

The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification…

Logic in Computer Science · Computer Science 2017-02-16 Marc Denecker , Bart Bogaerts , Joost Vennekens

In [{\it On the free implicative semilattice extension of a Hilbert algebra}. Mathematical Logic Quarterly 58, 3 (2012), 188--207], Celani and Jansana give an explicit description of the free implicative semilattice extension of a Hilbert…

Logic · Mathematics 2018-07-09 José L. Castiglioni , Hernán J. San Martín

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

We give a characterizations of toposes which admit a generating family of objects which are internally cardinal finite (i.e. Kuratowski finite and decidable) in terms of "topological" conditions. The central result is that, constructively,…

Category Theory · Mathematics 2016-04-06 Simon Henry

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

The aim of this paper is to relate algebraic quantum mechanics to topos theory, so as to construct new foundations for quantum logic and quantum spaces. Motivated by Bohr's idea that the empirical content of quantum physics is accessible…

Quantum Physics · Physics 2009-10-12 Chris Heunen , Nicolaas P. Landsman , Bas Spitters

In this paper you can explore the application of some notable Boolean-derived methods, namely the Disjunctive Normal Form representation of logic table expansions, and extend them to a real-valued logic model which is able to utilize…

Artificial Intelligence · Computer Science 2019-11-11 Jonathan Darren Nix

We introduce a relativized version of random Kripke's schema and show how it may be applied in the investigation of the expressive power of intuitionistic real algebra by interpreting second-order Heyting arithmetic in it.

Logic · Mathematics 2024-01-09 Miklós Erdélyi-Szabó

We illustrate the generative power of the lifting property (orthogonality of morphisms in a category) as means of defining natural elementary mathematical concepts by giving a number of examples in various categories, in particular showing…

Category Theory · Mathematics 2017-07-21 Misha Gavrilovich

In this paper we further the study of arrow algebras, simple algebraic structures inducing toposes through the tripos-to-topos construction, by defining appropriate notions of morphisms between them which correspond to morphisms of the…

Category Theory · Mathematics 2025-01-20 Umberto Tarantino

In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic. The main features of the resulting logic, we call InqLTL, are the intuitionistic interpretation of implication and the Boolean semantics of…

Logic in Computer Science · Computer Science 2025-05-19 Laura Bozzelli , Tadeusz Litak , Munyque Mittelmann , Aniello Murano

It is well known that general recursion cannot be expressed within Martin-Loef's type theory and various approaches have been proposed to overcome this problem still maintaining the termination of the computation of the typable terms. In…

Logic in Computer Science · Computer Science 2010-12-23 Claudio Sacerdoti Coen , Silvio Valentini

Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant which deals with statements of the…

Logic in Computer Science · Computer Science 2007-05-23 Frederick Furtek

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

The effectful forcing technique allows one to show that the denotation of a closed System T term of type $(\iota \to \iota) \to \iota$ in the set-theoretical model is a continuous function $(\mathbb{N} \to \mathbb{N}) \to \mathbb{N}$. For…

Logic in Computer Science · Computer Science 2025-05-19 Martin H. Escardo , Bruno da Rocha Paiva , Vincent Rahli , Ayberk Tosun

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov

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 continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Logic in Computer Science · Computer Science 2017-04-04 Andreas B. M. Brunner , Steffen Lewitzka