English
Related papers

Related papers: Ultraproducts in abstract categorical logic

200 papers

We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…

Classical Analysis and ODEs · Mathematics 2015-07-07 Matthias Mossburger

We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…

Logic · Mathematics 2024-11-04 Greta Coraglia , Ivan Di Liberti

We undertake to develop a successful framework for commutative-associative hypercomplex numbers with the view to explicate and study associated geometric and generalized-relativistic concepts, basing on an interesting possibility to…

General Relativity and Quantum Cosmology · Physics 2007-05-23 D. G. Pavlov

We consider a sequence of successively more restrictive definitions of abstraction for causal models, starting with a notion introduced by Rubenstein et al. (2017) called exact transformation that applies to probabilistic causal models,…

Artificial Intelligence · Computer Science 2019-07-11 Sander Beckers , Joseph Y. Halpern

Subtyping, also known as subtype polymorphism, is a concept extensively studied in programming language theory, delineating the substitutability relation among datatypes. This property ensures that programs designed for supertype objects…

Artificial Intelligence · Computer Science 2025-02-14 Đorđe Marković , Marc Denecker

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau

We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…

Logic · Mathematics 2026-03-23 Kazumi Kasaura

We present theoretical and practical results on the order theory of lattices of functions, focusing on Galois connections that abstract (sets of) functions - a topic known as higher-order abstract interpretation. We are motivated by the…

Programming Languages · Computer Science 2025-08-01 Louis Rustenholz , Pedro Lopez-Garcia , Manuel V. Hermenegildo

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…

Logic in Computer Science · Computer Science 2023-06-22 Łukasz Czajka

In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic. The main features of the resulting logic, we call InqLTL, are the intuitionistic interpretation of implication and the Boolean semantics of…

Logic in Computer Science · Computer Science 2025-05-19 Laura Bozzelli , Tadeusz Litak , Munyque Mittelmann , Aniello Murano

We begin the study of categorical logic for continuous model theory. In particular, we 1. introduce the notions of metric logical categories and functors as categorical equivalents of a metric theory and interpretations, 2. prove a…

Logic · Mathematics 2016-07-12 Jean-Martin Albert , Bradd Hart

Abstract reasoning, i.e., inferring complicated patterns from given observations, is a central building block of artificial general intelligence. While humans find the answer by either eliminating wrong candidates or first constructing the…

Machine Learning · Computer Science 2021-08-12 Sihyun Yu , Sangwoo Mo , Sungsoo Ahn , Jinwoo Shin

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

Programming Languages · Computer Science 2024-08-22 Michał J. Gajda

Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…

Quantum Physics · Physics 2009-02-19 Decio Krause , Hercules de Araujo Feitosa

We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…

Logic in Computer Science · Computer Science 2019-02-12 Sergey Slavnov

Providing explanations along with predictions is crucial in some text processing tasks. Therefore, we propose a new self-interpretable model that performs output prediction and simultaneously provides an explanation in terms of the presence…

Machine Learning · Computer Science 2019-09-30 Diane Bouchacourt , Ludovic Denoyer

We propose a new line of attack to create a finite quantum theory which includes general relativity and (perhaps) the standard model in its low energy limit. The theory would emerge from the categorical approach. A structure is observed on…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Louis Crane

We survey Lawvere theories at the level of infinity categories, as an alternative framework for higher algebra (rather than infinity operads). From a pedagogical perspective, they make many key definitions and constructions less technical.…

Category Theory · Mathematics 2019-03-12 John D. Berman

This is an introduction to the study of abstract homotopy theory by means of model categories and $(\infty,1)$-categories. The only prerequisites are very basic general topology and abstract algebra. None categorical background is needed.…

Algebraic Topology · Mathematics 2020-08-13 Yuri Ximenes Martins

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira
‹ Prev 1 4 5 6 7 8 10 Next ›