English
Related papers

Related papers: Implicative models of intuitionistic set theory

200 papers

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

A standard form of analysis for linguistic typology is the universal implication. These implications state facts about the range of extant languages, such as ``if objects come after verbs, then adjectives come after nouns.'' Such…

Computation and Language · Computer Science 2009-07-07 Hal Daumé , Lyle Campbell

Probabilistic models learned as density estimators can be exploited in representation learning beside being toolboxes used to answer inference queries only. However, how to extract useful representations highly depends on the particular…

Machine Learning · Computer Science 2016-08-12 Antonio Vergari , Nicola Di Mauro , Floriana Esposito

In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…

Logic in Computer Science · Computer Science 2020-07-16 Étienne Miquey

In this paper intuitionistic topological system and its properties have been introduced. Categorical interrelationships among Heyting algebra, G\"odel algebra, Esakia space and proposed intuitionistic topological systems have also been…

Logic · Mathematics 2020-05-05 Antonio Di Nola , Revaz Grigolia , Purbita Jana

Understanding the predictions made by deep learning models remains a central challenge, especially in high-stakes applications. A promising approach is to equip models with the ability to answer counterfactual questions -- hypothetical…

Machine Learning · Computer Science 2025-10-28 Inwoo Hwang , Yushu Pan , Elias Bareinboim

In "Extensional realizability for intuitionistic set theory", we introduced an extensional variant of generic realizability, where realizers act extensionally on realizers, and showed that this form of realizability provides "inner" models…

Logic · Mathematics 2024-12-10 Emanuele Frittaion

It is a well-known fact that although the poset of open sets of a topological space is a Heyting algebra, its Heyting implication is not necessarily stable under the inverse image of continuous functions and hence is not a geometric…

Logic · Mathematics 2024-05-09 Amirhossein Akbar Tabatabai

We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for…

Logic · Mathematics 2021-10-05 Tim S. Lyon

In this paper we continue with the algebraic study of Krivine's realizability, refining some of the authors' previous constructions by introducing two categories, with objects the abstract Krivine structures and the implicative algebras…

Logic · Mathematics 2019-04-19 Walter Ferrer , Octavio Malherbe

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

Logic · Mathematics 2019-11-20 Takako Nemoto , Michael Rathjen

We call an Ising model tractable when it is possible to compute its partition function value (statistical inference) in polynomial time. The tractability also implies an ability to sample configurations of this model in polynomial time. The…

Computation · Statistics 2021-12-07 Valerii Likhosherstov , Yury Maximov , Michael Chertkov

We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show that the arising concept of $r$-realizabilty has the property…

Logic · Mathematics 2024-08-14 Merlin Carl

We associate canonical virtual motives to definable sets over a field of characteristic zero. We use this construction to show that very general p-adic integrals are canonically interpolated by motivic ones.

Algebraic Geometry · Mathematics 2007-12-06 J. Denef , F. Loeser

We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…

Category Theory · Mathematics 2020-01-08 Sebastien Vasey

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

Artificial Intelligence · Computer Science 2012-06-18 Ydo Wexler , Christopher Meek

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

Logic · Mathematics 2024-12-02 Emanuele Frittaion , Takako Nemoto , Michael Rathjen

Starting from involutive BE algebras, we redefine the orthomodular algebras, by introducing the notion of implicative-orthomodular algebras. We investigate properties of implicative-orthomodular algebras, and give characterizations of these…

Logic · Mathematics 2024-01-09 Lavinia Corina Ciungu

This is the fourth in a series of papers extending Martin-L\"of's meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of…

Logic in Computer Science · Computer Science 2018-07-20 Evan Cavallo , Robert Harper

The clausal logical consequences of a formula are called its implicates. The generation of these implicates has several applications, such as the identification of missing hypotheses in a logical specification. We present a procedure that…

Logic in Computer Science · Computer Science 2018-07-13 Mnacho Echenim , Nicolas Peltier , Yanis Sellami