English
Related papers

Related papers: Theory of Interpretations I. Foundations

200 papers

This paper discusses the representation of ontologies in the first-order logical environment {\ttfamily FOLE}. An ontology defines the primitives with which to model the knowledge resources for a community of discourse. These primitives…

Databases · Computer Science 2023-04-25 Robert E. Kent

Ornaments aim at taming the multiplication of special-purpose datatype in dependently-typed theory. In its original form, the definition of ornaments is tied to a particular universe of datatypes. Being a type theoretic object,…

Programming Languages · Computer Science 2013-04-23 Pierre-Evariste Dagand , Conor McBride

The central focus is on clarifying the distinction between sets and proper classes. To this end we identify several categories of concepts (surveyable, definite, indefinite), and we attribute the classical set theoretic paradoxes to a…

History and Overview · Mathematics 2011-12-30 Nik Weaver

We developed a type-theoretical framework for natural lan- guage semantics that, in addition to the usual Montagovian treatment of compositional semantics, includes a treatment of some phenomena of lex- ical semantic: coercions, meaning,…

Computation and Language · Computer Science 2014-01-06 Bruno Mery , Richard Moot , Christian Retoré

Metaphysical interpretations of set theory are either inconsistent or incoherent. The uses of sets in mathematics actually involve three distinct kinds of collections (surveyable, definite, and heuristic), which are governed by three…

History and Overview · Mathematics 2009-05-12 Nik Weaver

Time series interpretation aims to provide an explanation of what is observed in terms of its underlying processes. The present work is based on the assumption that the common classification-based approaches to time series interpretation…

Artificial Intelligence · Computer Science 2021-12-09 Tomás Teijeiro , Paulo Félix

Neural networks have greatly boosted performance in computer vision by learning powerful representations of input data. The drawback of end-to-end training for maximal overall performance are black-box models whose hidden representations…

Computer Vision and Pattern Recognition · Computer Science 2020-04-29 Patrick Esser , Robin Rombach , Björn Ommer

Improving the interpretability of brain decoding approaches is of primary interest in many neuroimaging studies. Despite extensive studies of this type, at present, there is no formal definition for interpretability of brain decoding…

Machine Learning · Statistics 2016-06-21 Seyed Mostafa Kia , Andrea Passerini

A central feature in the Copenhagen interpretation is the use of classical concepts from the outset. Modern developments show, however, that the emergence of classical properties can be understood within the framework of quantum theory…

Quantum Physics · Physics 2007-05-23 Claus Kiefer

As a contribution to metaphor analysis, we introduce a statistical, data-based investigation with empirical analysis of long-standing conjectures and a first-ever empirical exploration of the systematic features of metaphors. Conversely,…

Computation and Language · Computer Science 2023-09-18 Marie Teich , Wilmer Leal , Juergen Jost

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Combinatorics · Mathematics 2014-10-13 Cheyne Homberger

The lack of interpretability has hindered the large-scale adoption of AI technologies. However, the fundamental idea of interpretability, as well as how to put it into practice, remains unclear. We provide notions of interpretability based…

Machine Learning · Computer Science 2021-11-18 Hangcheng Dong , Bingguo Liu , Fengdong Chen , Dong Ye , Guodong Liu

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Logic · Mathematics 2017-02-23 Matthew Harrison-Trainor

We present an abstract unifying framework for interpreting Stone-type dualities; several known dualities are seen to be instances of just one topos-theoretic phenomenon, and new dualities are introduced. In fact, infinitely many new…

Category Theory · Mathematics 2011-04-06 Olivia Caramello

When predictive models are used to support complex and important decisions, the ability to explain a model's reasoning can increase trust, expose hidden biases, and reduce vulnerability to adversarial attacks. However, attempts at…

Machine Learning · Computer Science 2019-07-11 Dimitris Bertsimas , Arthur Delarue , Patrick Jaillet , Sebastien Martin

Recently it has been argued that autocatalytic theory could be applied to the origin of culture. Here possible application to a theory of meaning in the philosophy of language, called radical interpretation, is commented upon and compared…

Computation and Language · Computer Science 2007-05-23 Mark D. Roberts

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

Logic · Mathematics 2020-09-14 Andrej Bauer , Philipp G. Haselwarter , Peter LeFanu Lumsdaine

In contrast to the robust mutual interpretability phenomenon in set theory, Ali Enayat proved that bi-interpretation is absent: distinct theories extending ZF are never bi-interpretable and models of ZF are bi-interpretable only when they…

Logic · Mathematics 2020-08-05 Alfredo Roque Freire , Joel David Hamkins

A paradigm for a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. This is achieved through the study of subgroups of nonstandard models…

Number Theory · Mathematics 2016-03-14 T. M. Gendron

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

Logic · Mathematics 2013-12-25 Saharon Shelah