English
Related papers

Related papers: Some remarks on one-basedness

200 papers

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…

General Topology · Mathematics 2018-04-13 Wanjun Hu

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

We classify the unipotent character sheaves on a fixed connected component of a reductive algebraic group under a mild hypothesis on the characteristic of the ground field.

Representation Theory · Mathematics 2008-07-17 G. Lusztig

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

Logic · Mathematics 2021-09-15 Saharon Shelah

All simple translation-invariant valuations on polytopes are classified. As a direct consequence the well-known conditions for translative-equidecomposability are recovered. Furthermore, a simplified proof of the classification of…

Metric Geometry · Mathematics 2015-07-07 Katharina Kusejko , Lukas Parapatits

Due to the emergence of the semantic Web and the increasing need to formalize human knowledge, ontologie engineering is now an important activity. But is this activity very different from other ones like software engineering, for example ?…

Information Retrieval · Computer Science 2011-04-18 Mireille Arnoux , Thierry Despeyroux

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

We introduce the notion of "type" of a tableau, that allows us to define new families of tableaux including both balanced and standard Young tableaux. We use these new objects to describe the set of reduced decompositions of any…

Combinatorics · Mathematics 2016-03-11 François Viard

We show that certain diagrams of $\infty$-logoses are reconstructed in homotopy type theory extended with some lex, accessible modalities, which enables us to use plain homotopy type theory to reason about not only a single $\infty$-logos…

Category Theory · Mathematics 2026-03-18 Taichi Uemura

This paper characterizes the single-peaked domain on a tree via the strategy-proofness of extreme rules defined on that tree. For any tree, these rules are unanimous and anonymous on any preference domain. In particular, we show that they…

Theoretical Economics · Economics 2026-04-30 Mihir Bhattacharya , Anup Pramanik

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

It is discussed a practical possibility of a provable programming of mathematics basing on intuitionism and the dependent types feature of a programming language.The principles of constructive mathematics and provable programming are…

Logic in Computer Science · Computer Science 2017-09-07 Sergei D. Meshveliani

We study the homotopy type of the simplicial set of continuous semi-algebraic simplexes of an algebraic variety defined over a real closed field, which we will call the real homotopy type. We prove an analogue of the theorem of Artin-Mazur…

Algebraic Geometry · Mathematics 2022-07-05 Ambrus Pál

In this note we show that Voevodsky's univalence axiom holds in the model of type theory based on symmetric cubical sets. We will also discuss Swan's construction of the identity type in this variation of cubical sets. This proves that we…

Logic · Mathematics 2017-10-31 Marc Bezem , Thierry Coquand , Simon Huber

Algebraic varieties which are locally isomorphic to open subsets of affine space will be called {\em plain}. Plain varieties are smooth and rational. The converse is true for curves and surfaces, and unknown in general. It is shown that…

Algebraic Geometry · Mathematics 2014-02-26 Gábor Bodnár , Herwig Hauser , Josef Schicho , Orlando Villamayor

We develop the theory of locally small spaces in a new simple language and apply this simplification to re-build the theory of locally definable spaces over structures with topologies.

General Topology · Mathematics 2020-09-08 Artur Piękosz

Evidence for fine-tuning of physical parameters suitable for life can perhaps be explained by almost any combination of providence, coincidence or multiverse. A multiverse usually includes parts unobservable to us, but if the theory for it…

High Energy Physics - Theory · Physics 2007-05-23 Don N. Page

Massive single-cell profiling efforts have accelerated our discovery of the cellular composition of the human body, while at the same time raising the need to formalise this new knowledge. Here, we review current cell ontology efforts to…

Cell Behavior · Quantitative Biology 2021-11-10 David Osumi-Sutherland , Chuan Xu , Maria Keays , Peter V. Kharchenko , Aviv Regev , Ed Lein , Sarah A. Teichmann

We describe the first results of a project of analyzing in which theories formal proofs can be ex- pressed. We use this analysis as the basis of interoperability between proof systems.

Logic in Computer Science · Computer Science 2017-12-06 Gilles Dowek
‹ Prev 1 8 9 10 Next ›