English
Related papers

Related papers: Idempotents in intensional type theory

200 papers

We extend some properties of a pair of ideals described in terms of Tor modules to any number of ideals, including the well-known rigidity property. Those extensions require the development of a homological theory for spectral sequences…

Commutative Algebra · Mathematics 2026-04-23 Arindam Banerjee , Marc Chardin , Rafael Holanda

Following A. Kuznetsov's outline, we restore Kuznetsov's syntactic proof of the assertoric equipollence of the intuitionistic propositional calculus and the proof-intuitionistic calculus KM (Kuznetsov's Theorem). Then, we show that this…

Logic · Mathematics 2017-08-24 Alexei Muravitsky

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Logic · Mathematics 2024-12-19 Carlos Caleiro , Pedro Filipe , Sérgio Marcelino

We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…

Logic · Mathematics 2026-04-08 Lyra A. Gardiner

In homotopy type theory, we construct the propositional truncation as a colimit, using only non-recursive higher inductive types (HITs). This is a first step towards reducing recursive HITs to non-recursive HITs. This construction gives a…

Logic · Mathematics 2015-12-09 Floris van Doorn

Let $\Lambda$ be an artin algebra and $\mathfrak{A}$ a two-sided idempotent ideal of $\Lambda$, that is, $\mathfrak{A}$ is the trace of a projective $\Lambda$-module $P$ in $\Lambda$. We consider the categories of finitely generated modules…

Rings and Algebras · Mathematics 2015-09-09 Andrea Gatica , Marcelo Lanzilotta , María Inés Platzeck

We study asymmetric regular types. If $\frak p$ is regular and $A$-asymmetric then there exists a strict order such that Morley sequences in $\frak p$ over $A$ are strictly increasing (we allow Morley sequences to be indexed by elements of…

Logic · Mathematics 2015-03-17 Slavko Moconja , Predrag Tanović

Stable infiniteness, strong finite witnessability, and smoothness are model-theoretic properties relevant to theory combination in satisfiability modulo theories. Theories that are strongly finitely witnessable and smooth are called…

Logic · Mathematics 2024-06-28 Benjamin Przybocki , Guilherme Toledo , Yoni Zohar , Clark Barrett

Under a sharp asymptotic growth condition at infinity, we prove a Liouville type theorem for the inhomogeneous porous medium equation, provided it stays universally close to the heat equation. Additionally, for the homogeneous equation, we…

Analysis of PDEs · Mathematics 2022-01-07 Damião J. Araújo , Rafayel Teymurazyan

Suppose $(\mathcal{C},\mathbb{E},\mathfrak{s})$ is an $n$-exangulated category. We show that the idempotent completion and the weak idempotent completion of $\mathcal{C}$ are again $n$-exangulated categories. Furthermore, we also show that…

Category Theory · Mathematics 2024-08-23 Carlo Klapproth , Dixy Msapato , Amit Shah

The usual homogeneous form of equality type in Martin-L\"of Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly…

Logic in Computer Science · Computer Science 2022-03-15 Andrew M. Pitts

Given a homogeneous Poisson process on ${\mathbb{R}}^d$ with intensity $\lambda$, we prove that it is possible to partition the points into two sets, as a deterministic function of the process, and in an isometry-equivariant way, so that…

Probability · Mathematics 2011-12-09 Alexander E. Holroyd , Russell Lyons , Terry Soo

A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…

Category Theory · Mathematics 2022-05-16 Iosif Petrakis

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Logic · Mathematics 2023-07-10 Djamel Eddine Amir , Mathieu Hoyrup

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…

Logic in Computer Science · Computer Science 2016-10-27 Emil Jeřábek

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…

Logic in Computer Science · Computer Science 2023-06-22 James Laird

In this paper, using the canonical correspondence between the idempotents and clopens, we obtain several new results on lifting idempotents. The Zariski clopens of the maximal spectrum are precisely determined, then as an application,…

Commutative Algebra · Mathematics 2021-12-30 Abolfazl Tarizadeh , Pramod K. Sharma

We prove a number of results on the survival of the type-I property under extensions of locally compact groups: (a) that given a closed normal embedding $\mathbb{N}\trianglelefteq\mathbb{E}$ of locally compact groups and a twisted action…

Operator Algebras · Mathematics 2022-06-14 Alexandru Chirvasitu

We show that irreducible unipotent representations of split Levi subgroups of finite groups of Lie type extend to their stabilizers inside the normalizer of the given Levi subgroup. For this purpose, we extend the multiplicity-freeness…

Representation Theory · Mathematics 2021-01-05 Matthias Klupsch

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…

Logic in Computer Science · Computer Science 2016-08-05 Amelia Harrison , Vladimir Lifschitz