English
Related papers

Related papers: I-Types of System F

200 papers

This paper continues the series of papers that develop a new approach to syntax and semantics of dependent type theories. Here we study the interpretation of the rules of the identity types in the intensional Martin-Lof type theories on the…

Category Theory · Mathematics 2015-05-26 Vladimir Voevodsky

We give a new elementary proof of the main theorem of [Fef12]: Quantifiers implicitly definable in pure second-order logic equipped with Henkin semantics implies are (explicitly) definable in first-order logic.

Logic · Mathematics 2014-10-15 Fredrik Engström

We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…

Logic in Computer Science · Computer Science 2021-07-20 Rafaël Bocquet , Ambrus Kaposi , Christian Sattler

We construct the first II_1 factors having exactly two group measure space decompositions up to unitary conjugacy. Also, for every positive integer $n$, we construct a II_1 factor $M$ that has exactly $n$ group measure space decompositions…

Operator Algebras · Mathematics 2017-06-13 Anna Sofie Krogager , Stefaan Vaes

We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization…

Logic in Computer Science · Computer Science 2023-06-22 Paolo Pistone

We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically,…

Logic · Mathematics 2016-08-02 Justyna Grudzinska , Marek Zawadowski

We use the theory of q-characters to establish a number of short exact sequences in the category of finite-dimensional representations of the quantum affine groups of types A and B. That allows us to introduce a set of 3-term recurrence…

Quantum Algebra · Mathematics 2012-12-07 E. Mukhin , C. A. S. Young

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah

A previous paper (arXiv:0902.2773, henceforth referred to as I) considered a general class of problems involving the evolution of large systems of globally coupled phase oscillators. It was shown there that, in an appropriate sense, the…

Chaotic Dynamics · Physics 2015-05-19 Edward Ott , Brian R. Hunt , Thomas M. Antonsen

Let $A$ be a unital simple separable exact C$^*$-algebra which is approximately divisible and of real rank zero. We prove that the set of positive elements in $A$ with a fixed Cuntz class is path connected. This result applies in particular…

Operator Algebras · Mathematics 2022-03-09 Andrew S. Toms

Let $X$ be a generic curve of genus $g$ defined over an algebraically closed field $k$ of characteristic $p\geq 0$. We show that for $n$ sufficiently large there exists a tame rational map $f:X\to \PP^1_k$ with monodromy group $A_n$. This…

Algebraic Geometry · Mathematics 2007-05-23 Irene I. Bouw , Stefan Wewers

In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…

Logic · Mathematics 2022-01-21 Matthias Kunik

It is shown that finitely presented icc inner amenable groups yield strongly 1-bounded II_1 factors.

Operator Algebras · Mathematics 2026-03-17 Ben Hayes , Srivatsav Kunnawalkam Elayavalli

In this note we give a wellfoundedness proof of a computable notation system for first-order reflection.

Logic · Mathematics 2019-04-03 Toshiyasu Arai

We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…

Logic in Computer Science · Computer Science 2012-10-26 Ugo Dal Lago , Barbara Petit

We apply some methods and technique of complex dynamics to study the set of symmetries of attractors of holomorphic Iterated Function Systems (IFS), as well as relations between IFS sharing the same attractor.

Dynamical Systems · Mathematics 2025-01-15 Genadi Levin

We show that a suitable quantitative Fatou Theorem characterizes uniform rectifiability in the codimension 1 case.

Analysis of PDEs · Mathematics 2018-01-08 Simon Bortz , Steve Hofmann

It is well known that nice conditions on the canonical module of a local ring have a strong impact in the study of strong F-regularity and F-purity. In this note, we prove that if (R,m) is an equidimensional and S_2 local ring that admits a…

Commutative Algebra · Mathematics 2013-10-10 Linquan Ma

In the present paper, based on the previous work (Part I), we present a game semantics for the intensional variant of intuitionistic type theory that refutes the principle of uniqueness of identity proofs and validates the univalence axiom,…

Logic in Computer Science · Computer Science 2016-04-06 Norihiro Yamada

The aim of this paper is to extend the external characterization of I-favorable spaces. This allows us to obtain a characterization of compact I-favorable spaces in terms of quasi k-metrics. We also provide proofs of some author's results…

General Topology · Mathematics 2018-01-23 Vesko Valov
‹ Prev 1 3 4 5 6 7 10 Next ›