English
Related papers

Related papers: Universal properties of truth

200 papers

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing…

Logic · Mathematics 2020-08-27 Samuel Allen Alexander

In this article we focus on evolving information systems. First a delimitation of the concept of evolution is provided, resulting in a first attempt to a general theory for such evolutions. The theory makes a distinction between the…

Artificial Intelligence · Computer Science 2021-05-25 H. A. Proper , Th. P. van der Weide

A rough overview is given over the most essential structures underlying all working quantum theoretical models as well as axiomatic and algebraic quantum field theory .

Quantum Physics · Physics 2011-04-15 W. Luecke

We develop an analogue of universal algebra in which generating symbols are interpreted as relations. We prove a variety theorem for these relational algebraic theories, in which we find that their categories of models are precisely the…

Category Theory · Mathematics 2021-11-09 Chad Nester

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

Underlying the theory of inferences, a primary task of logic is language analysis. Such a task can be understood as depending on a general theory of representation, taking as a starting point the idea that some entities (`` representations…

Logic in Computer Science · Computer Science 2023-07-21 Arnaud Plagnol

Large Language Models (LLMs) have demonstrated impressive generalization capabilities across various tasks, but their claim to practical relevance is still mired by concerns on their reliability. Recent works have proposed examining the…

Machine Learning · Computer Science 2025-07-08 Waiss Azizian , Michael Kirchhof , Eugene Ndiaye , Louis Bethune , Michal Klein , Pierre Ablin , Marco Cuturi

We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…

Logic · Mathematics 2022-08-09 Pablo Cubides Kovacsics , Jinhe Ye

A unified theory of language combines a Bayesian cognitive linguistic model of language processing, with the proposal that language evolved by sexual selection for the display of intelligence. The theory accounts for the major facts of…

Neurons and Cognition · Quantitative Biology 2025-08-29 Robert Worden

Large language models (LLMs) have been reported to linearly encode truthfulness, yet recent work questions this finding's generality. We reconcile these views with the truthfulness spectrum hypothesis: the representational space contains…

Machine Learning · Computer Science 2026-02-25 Zhuofan Josh Ying , Shauli Ravfogel , Nikolaus Kriegeskorte , Peter Hase

Realizability for knowledge representation formalisms studies the following question: given a semantics and a set of interpretations, is there a knowledge base whose semantics coincides exactly with the given interpretation set? We…

Artificial Intelligence · Computer Science 2016-04-01 Thomas Linsbichler , Jörg Pührer , Hannes Strass

The effectiveness of binary analysis tools and techniques is often measured with respect to how well they map to a ground truth. We have found that not all ground truths are created equal. This paper challenges the binary analysis community…

Cryptography and Security · Computer Science 2022-10-28 Jim Alves-Foss , Varsah Venugopal

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C Laskowski

A knowledge system S describing a part of real world does in general not contain complete information. Reasoning with incomplete information is prone to errors since any belief derived from S may be false in the present state of the world.…

Artificial Intelligence · Computer Science 2011-05-20 Eliezer L. Lozinskii

This paper describes a universal model for paraphrasing that transforms according to defined criteria. We showed that by using different criteria we could construct different kinds of paraphrasing systems including one for answering…

Computation and Language · Computer Science 2007-05-23 Masaki Murata , Hitoshi Isahara

In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology, which can be formulated in a description logic (DL) or using existential rules. In the literature, there…

Logic in Computer Science · Computer Science 2022-08-31 Christian Alrabbaa , Stefan Borgwardt , Patrick Koopmann , Alisa Kovtunova

Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a…

Logic · Mathematics 2023-05-17 Will Stafford

Conditional acceptability refers to how plausible a conditional statement is perceived to be. It plays an important role in communication and reasoning, as it influences how individuals interpret implications, assess arguments, and make…

Computation and Language · Computer Science 2026-03-20 Jasmin Orth , Philipp Mondorf , Barbara Plank

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

By considering probability distributions over the set of assignments the expected truth values assignment to propositional variables are extended through linear operators, and the expected truth values of the clauses at any given…

Logic in Computer Science · Computer Science 2010-07-07 Guillermo Morales-Luna