English
Related papers

Related papers: Cubical Type Theoretic Navya-Ny\=aya

200 papers

We prove the following continuous analogue of Vaught's Two-Cardinal Theorem: if for some $\kappa>\lambda\geq \aleph_0$, a continuous theory $T$ has a model with density character $\kappa$ which has a definable subset of density character…

Logic · Mathematics 2021-10-13 Victoria Noquez

In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…

Logic in Computer Science · Computer Science 2021-07-30 José Espírito Santo , Ralph Matthes , Luís Pinto

We introduce Natural Qubit Algebra (NQA), a compact real operator calculus for qubit systems based on a $2\times2$ block alphabet $\{I,X,Z,W\}\subset\mathrm{Mat}(2,\mathbb{R})$ and tensor-word representations. The resulting multiplication…

Quantum Physics · Physics 2026-02-26 Grigory Koroteev

We present a new model of Guarded Dependent Type Theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with, and reason about coinductive types. Productivity of recursively defined coinductive…

Logic in Computer Science · Computer Science 2020-04-14 Aleš Bizjak , Rasmus Ejlers Møgelberg

The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of…

Logic in Computer Science · Computer Science 2018-05-18 Patrick Bahr

We consider the conversion problem for multimodal type theory (MTT) by characterizing the normal forms of the type theory and proving normalization. Normalization follows from a novel adaptation of Sterling's Synthetic Tait Computability…

Logic in Computer Science · Computer Science 2021-06-04 Daniel Gratzer

We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly…

Logic in Computer Science · Computer Science 2019-03-14 Harley Eades , Aaron Stump , Ryan McCleeary

We define and develop two-level type theory (2LTT), a version of Martin-L\"of type theory which combines two different type theories. We refer to them as the inner and the outer type theory. In our case of interest, the inner theory is…

Logic in Computer Science · Computer Science 2026-05-27 Danil Annenkov , Paolo Capriotti , Nicolai Kraus , Christian Sattler

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Logic · Mathematics 2013-08-30 Andre Nies

We investigate, by numerical simulations on a lattice, the $\theta$-dependence of 2$d$ $CP^{N-1}$ models for a range of $N$ going from 9 to 31, combining imaginary $\theta$ and simulated tempering techniques to improve the signal-to-noise…

High Energy Physics - Lattice · Physics 2019-01-30 Claudio Bonanno , Claudio Bonati , Massimo D'Elia

Canonical tensor model (CTM) is a tensor model formulated in the Hamilton formalism as a totally constrained system with first class constraints, the algebraic structure of which is very similar to that of the ADM formalism of general…

High Energy Physics - Theory · Physics 2017-07-05 Gaurav Narain , Naoki Sasakura

We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…

Logic in Computer Science · Computer Science 2025-12-12 Philippe Malbos , Tanguy Massacrier , Georg Struth

We advocate the use of de Bruijn's universal abstraction $\lambda^\infty$ for the quantification of schematic variables in the predicative setting and we present a typed $\lambda$-calculus featuring the quantifier $\lambda^\infty$…

Logic in Computer Science · Computer Science 2021-05-11 Ferruccio Guidi

Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory…

Quantum Physics · Physics 2026-04-23 Filippo Iulianelli , Sung Kim , Joshua Sussan , Aaron D. Lauda

We present a new dependent type system, NM-DEKL$^3_\infty$ (Non-Monotone Dependent Knowledge-Enhanced Logic), for formalising evolving knowledge in dynamic environments. The system uses a three-layer architecture separating a computational…

Logic in Computer Science · Computer Science 2026-03-03 Peng Chen

In this paper, we hypothesize that the effects of the degree of typicality in natural semantic categories can be generated based on the structure of artificial categories learned with deep learning models. Motivated by the human approach to…

Computer Vision and Pattern Recognition · Computer Science 2021-07-08 Omar Vidal Pino , Erickson Rangel Nascimento , Mario Fernando Montenegro Campos

We apply the SL(2,C) lattice Kac-Moody algebra of Alekseev, Faddeev and Semenov-Tian-Shansky to obtain a new lattice description of the SU(2) chiral model in two dimensions. The system has a global quantum group symmetry and it can be…

High Energy Physics - Theory · Physics 2009-10-30 A. Stern , P. Vitale

Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type $\sigma$ is encodable as a definable retract of $\tau$: that is, when there are $\lambda$-terms…

Logic in Computer Science · Computer Science 2018-06-04 John Longley

We introduce $(\sigma,\tau)$-algebras as a framework for twisted differential calculi over noncommutative, as well as commutative, algebras with motivations from the theory of $\sigma$-derivations and quantum groups. A…

Quantum Algebra · Mathematics 2022-07-19 Joakim Arnlind , Kwalombota Ilwale