Related papers: Are there Hilbert-style Pure Type Systems?
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…
We show that typicality holds for a class of nonequilibrium systems, i.e., nonequilibrium steady states (NESSs): almost all the pure states properly sampled from a certain Hilbert space well represent a NESS and characterize its intrinsic…
One of the authors has recently introduced the concept of conjugate Hamiltonian systems: the solution of the equation $h=H(p,q,t),$ where $H$ is a given Hamiltonian containing $t$ explicitly, yields the function $t=T(p,q,h)$, which defines…
We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on…
Picat, a new member of the logic programming family, follows a different doctrine than Prolog in offering the core logic programming concepts: arrays and maps as built-in data types; implicit pattern matching with explicit unification and…
Dummett's logic LC is intuitionistic logic extended with Dummett's axiom: for every two statements the first implies the second or the second implies the first. We present a natural deduction and a Curry-Howard correspondence for…
This paper is the first in a series whose goal is to develop a fundamentally new way of constructing theories of physics. The motivation comes from a desire to address certain deep issues that arise when contemplating quantum theories of…
We introduce the notion of a logical model category which is a Quillen model category satisfying some additional conditions. Those conditions provide enough expressive power that one can soundly interpret dependent products and sums in it.…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…
Let H_1 and H_2 be complex Hilbert spaces, L_1=P(H_1) and L_2=P(H_2) the lattices of closed subspaces, and let L be a complete atomistic lattice. We prove under some weak assumptions relating L_i and L, that if L admits an…
Let $R$ be the polynomial ring $K[x_{i,j}]$ where $1 \le i \le r$ and $j \in \mathbb{N}$, and let $I$ be an ideal of $R$ stable under the natural action of the infinite symmetric group $S_{\infty}$. Nagel--R\"omer recently defined a Hilbert…
Let P be any pure type system, we are going to show how we can extend P into a PTS P' which will be used as a proof system whose formulas express properties about sets of terms of P. We will show that P' is strongly normalizable if and only…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
In this paper, I establish the categorical structure necessary to interpret dependent inductive and coinductive types. It is well-known that dependent type theories \`a la Martin-L\"of can be interpreted using fibrations. Modern theorem…
Type theory can be described as a generalised algebraic theory. This automatically gives a notion of model and the existence of the syntax as the initial model, which is a quotient inductive-inductive type. Algebraic definitions of type…
The approach to proof search dubbed "coinductive proof search" (CoIPS), and previously developed by the authors for implicational intuitionistic logic, is in this paper extended to LJP, a focused sequent-calculus presentation of polarized…
The implicit hitting set (IHS) approach offers a general framework for solving computationally hard combinatorial optimization problems declaratively. IHS iterates between a decision oracle used for extracting sources of inconsistency and…
We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving…