English
Related papers

Related papers: I-Types of System F

200 papers

If $F$ and $G$ are iterated function systems, then any infinite word $W$ in the symbols $F$ and $G$ induces a limit set. It is natural to ask whether this Cantor set can also be realized as the limit set of a single $C^{1 + \alpha}$…

Dynamical Systems · Mathematics 2018-03-07 Ryan Broderick

We show that the F-signature of a local ring of characteristic p, defined by Huneke and Leuschke, is positive if and only if the ring is strongly F-regular.

Commutative Algebra · Mathematics 2007-05-23 Ian M. Aberbach , Graham J. Leuschke

We provide axiomatization and relative quantifier elimination for valued fields equipped with an automorphism, in residue characteristic zero. Similar results are known under strong assumptions on the interaction between the automorphism…

Logic · Mathematics 2013-09-24 Gönenç Onay , Salih Durhan

The notion of path-complete positivity is introduced as a way to generalize the property of positivity from one LTI system to a family of switched LTI systems whose switching rule is constrained by a finite automaton. The generalization…

Systems and Control · Computer Science 2016-11-09 Fulvio Forni , Raphael M. Jungers , Rodolphe Sepulchre

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Veneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

Logic in Computer Science · Computer Science 2021-05-11 Richard Statman , Andrew Polonsky

The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…

Logic in Computer Science · Computer Science 2015-07-01 Pablo Arrighi , Alejandro Diaz-Caro

This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier $I$. $I$ forms a formula from two…

Logic in Computer Science · Computer Science 2021-08-13 Nils Kürbis

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…

Logic · Mathematics 2023-03-31 Steve Awodey , Nicola Gambino , Kristina Sojakova

This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…

Logic in Computer Science · Computer Science 2026-04-15 Barry Jay , Johannes Bader

We prove several unique prime factorization results for tensor products of type II_1 factors coming from groups that can be realized either as subgroups of hyperbolic groups or as discrete subgroups of connected Lie groups of real rank 1.…

Operator Algebras · Mathematics 2009-11-10 Narutaka Ozawa , Sorin Popa

We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…

Group Theory · Mathematics 2012-05-01 Kate Juschenko , Nicolas Monod

In this note we introduce and study basic properties of two types of modules over a commutative noetherian ring $R$ of positive prime characteristic. The first is the category of modules of finite $F$-type. These objects include reflexive…

Commutative Algebra · Mathematics 2016-03-02 Hailong Dao , Tony Se

This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…

Logic in Computer Science · Computer Science 2013-05-06 Christian Retoré

We study $F$-graded systems of ideals in $R$, which are sequences of ideals giving rise to Cartier algebras on $R$. We identify how properties of these systems (or modifications of these systems) affect the singularity properties of the…

Commutative Algebra · Mathematics 2026-05-25 Anna Brosowsky

We show the existence of positive solutions for a class of singular elliptic systems with convection term. The approach combines pseudomonotone operator theory, sub and supersolution method and perturbation arguments involving singular…

Analysis of PDEs · Mathematics 2013-11-26 Claudianor O. Alves , Abdelkrim Moussaoui

We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…

Logic in Computer Science · Computer Science 2015-02-23 Andrew Polonsky

We give sufficient conditions to find all subtypes isomorphic to a subtype in a finite generalized ordered type.

Logic · Mathematics 2025-06-16 Jean S. Joseph

This paper is a technical continuation of ``Natural Axiom Schemata Extending ZFC. Truth in the Universe?'' In that paper we argue that $CIFS$ is a natural axiom schema for the universe of sets. In particular it is a natural closure…

Logic · Mathematics 2008-02-03 Garvin Melles

We show a general theorem of existence of temporal foliations in a general causal set, under mild constraints. Then we study automorphisms of infinite causal sets (which satisfy further requirements) and show that they fall under one of two…

General Relativity and Quantum Cosmology · Physics 2020-10-02 Ali Bleybel , Abdallah Zaiour

We propose axioms governing the interaction of constructive assertibility and meaningfulness predicates with a self-applicative truth predicate characterized by the T-scheme, and we prove the consistency of the resulting formal system.

Logic · Mathematics 2025-10-10 Nik Weaver