English
Related papers

Related papers: Models of Positive Truth

200 papers

We provide explicit descriptions for the rational powers and Rees valuations of several classes of ideals invariant under natural actions of tori and products of general linear groups, in terms of polyhedra and lattice points. This allows…

Commutative Algebra · Mathematics 2025-04-08 Sankhaneel Bisui , Sudipta Das , Tài Huy Hà , Jonathan Montaño

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 present the notions of positively complete theory and general forms of amalgamation in the framework of positive logic. We explore the fundamental properties of positively complete theories and study the behaviour of companion theories…

Logic · Mathematics 2019-11-15 Mohammed Belkasmi

We extend the notion of Heyting algebra to a notion of truth values algebra and prove that a theory is consistent if and only if it has a B-valued model for some non trivial truth values algebra B. A theory that has a B-valued model for all…

Logic in Computer Science · Computer Science 2023-05-15 Gilles Dowek

Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types and allow to define types which are not sets in the…

Logic in Computer Science · Computer Science 2018-05-09 Thorsten Altenkirch , Paolo Capriotti , Gabe Dijkstra , Nicolai Kraus , Fredrik Nordvall Forsberg

Large Language Models (LLMs) can generate factually inaccurate content even if they have corresponding knowledge, which critically undermines their reliability. Existing approaches attempt to mitigate this by incorporating uncertainty in QA…

Computation and Language · Computer Science 2026-04-14 Xiaoning Dong , Chengyan Wu , Yajie Wen , Yu Chen , Yun Xue , Jing Zhang , Wei Xu , Bolei Ma

We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…

Logic · Mathematics 2019-11-12 Saeed Salehi

In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose…

Logic · Mathematics 2021-09-07 Fedor Pakhomov , Albert Visser

We introduce $\Theta$-positivity, a new notion of positivity in real semisimple Lie groups. The notion of $\Theta$-positivity generalizes at the same time Lusztig's total positivity in split real Lie groups as well as well known concepts of…

Differential Geometry · Mathematics 2018-02-09 Olivier Guichard , Anna Wienhard

The languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (intuitionistic) negation. We demonstrate that including full…

Logic · Mathematics 2024-10-21 Fan Yang

Theory revision integrates inductive learning and background knowledge by combining training examples with a coarse domain theory to produce a more accurate theory. There are two challenges that theory revision and other theory-guided…

Artificial Intelligence · Computer Science 2008-02-03 S. K. Donoho , L. A. Rendell

We briefly explain some simple arguments based on pseudo Hermiticity, supersymmetry and PT-symmetry which explain the reality of the spectrum of some non-Hermitian Hamiltonians. Subsequently we employ PT-symmetry as a guiding principle to…

Quantum Physics · Physics 2008-04-17 Andreas Fring

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

Logic · Mathematics 2017-10-18 Nathanael Ackerman , Cameron Freer , Rehana Patel

At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…

Logic in Computer Science · Computer Science 2016-07-18 Jonathan Sterling

An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…

Logic in Computer Science · Computer Science 2024-05-07 Jose Meseguer

The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…

Artificial Intelligence · Computer Science 2013-02-08 Henry E. Kyburg

Kurt G\"odel proved that it is not possible to characterize Intuitionistic Propositional Logic (IPL) by means of finite and deterministic truth-tables. After extending the same result with respect to non-deterministic matrices, we provide a…

Logic · Mathematics 2025-12-23 Renato Leme , Marcelo Coniglio , Bruno Lopes

Two studies tested the hypothesis that a Large Language Model (LLM) can be used to model psychological change following exposure to influential input. The first study tested a generic mode of influence - the Illusory Truth Effect (ITE) -…

Computation and Language · Computer Science 2023-03-13 Lewis D Griffin , Bennett Kleinberg , Maximilian Mozes , Kimberly T Mai , Maria Vau , Matthew Caldwell , Augustine Marvor-Parker

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Lücke , Ana Njegomir , Philipp Schlicht

Let P be any pure type system, we are going to show how we can extend P into a PTS P' which will be used as a proof system whose formulas express properties about sets of terms of P. We will show that P' is strongly normalizable if and only…

Logic in Computer Science · Computer Science 2011-08-02 Marc Lasson