English
Related papers

Related papers: When Bi-interpretability implies Synonymy

200 papers

Semantic role theory considers roles as a small universal set of unanalyzed entities. It means that formally there are no restrictions on role combinations. We argue that the semantic roles co-occur in verb representations. It means that…

Computation and Language · Computer Science 2018-10-10 Aliaksandr Huminski , Hao Zhang , Gangeshwar Krishnamurthy

Interpretability and explainability have gained more and more attention in the field of machine learning as they are crucial when it comes to high-stakes decisions and troubleshooting. Since both provide information about predictors and…

Machine Learning · Computer Science 2024-04-26 Benjamin Leblanc , Pascal Germain

We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin-L\"{o}f type theory, two-level type theory and cubical type theory. We establish basic results in the semantics of type theory:…

Category Theory · Mathematics 2023-08-10 Taichi Uemura

While syntactic inference restrictions don't play an important role for SAT, they are an essential reasoning technique for more expressive logics, such as first-order logic, or fragments thereof. In particular, they can result in short…

Logic in Computer Science · Computer Science 2020-01-01 Christoph Weidenbach

The meaning of a sentence is a function of the relations that hold between its words. We instantiate this relational view of semantics in a series of neural models based on variants of relation networks (RNs) which represent a set of…

Computation and Language · Computer Science 2018-11-27 Lei Yu , Cyprien de Masson d'Autume , Chris Dyer , Phil Blunsom , Lingpeng Kong , Wang Ling

We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…

Logic · Mathematics 2019-01-28 Sergey Sudoplatov

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…

Category Theory · Mathematics 2007-05-23 Noson S. Yanofsky

Vocabulary learning by children can be characterized by many biases. When encountering a new word, children as well as adults, are biased towards assuming that it means something totally different from the words that they already know. To…

Computation and Language · Computer Science 2017-02-09 Ramon Ferrer-i-Cancho

People's associations between colors and concepts influence their ability to interpret the meanings of colors in information visualizations. Previous work has suggested such effects are limited to concepts that have strong, specific…

Human-Computer Interaction · Computer Science 2023-09-22 Kushin Mukherjee , Brian Yin , Brianne E. Sherman , Laurent Lessard , Karen B. Schloss

Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl , Dan Marsden , Nihil Shah

We propose a model theoretic interpretation of the theorems about the equivalence between mixed characteristic perfectoid spaces and their tilts.

Logic · Mathematics 2025-06-23 Silvain Rideau-Kikuchi , Thomas Scanlon , Pierre Simon

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

We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…

Logic in Computer Science · Computer Science 2018-09-14 Daniel Danielski , Emanuel Kieronski

A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…

Logic in Computer Science · Computer Science 2025-10-17 Sara Ayhan

We introduce a hierarchical classification of theories that describe systems with fundamentally limited information content. This property is introduced in an operational way and gives rise to the existence of mutually complementary…

Quantum Physics · Physics 2010-05-27 Tomasz Paterek , Borivoje Dakic , Caslav Brukner

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

Some considerations showing that renormalizable theories with consistent perturbative theries can not be nonperturbatively finite (in terms of bare parameters) are provided. Accordingly any fundamental unified theory has to be either non…

High Energy Physics - Theory · Physics 2008-02-03 J. Gegelia , N. Kiknadze

Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…

Category Theory · Mathematics 2007-05-31 Jonathan A. Cohen

Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential and parallel composition, as…

Logic in Computer Science · Computer Science 2015-06-16 Hitoshi Furusawa , Georg Struth

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro