Related papers: Syntactic Structure, Quantum Weights
Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point…
We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums, identity types, and other inductive types.…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
We review the Euclidean Hopf algebra $U_q(e^N)$ dual of $Fun(\rn_q^N\lcross SO_{q^{-1}}(N))$ and describe its fundamental Hilbert space representations \cite{fioeu}, which turn out to be rather simple "lattice-regularized" versions of the…
Drawing appropriate defeasible inferences has been proven to be one of the most pervasive puzzles of natural language processing and a recurrent problem in pragmatics. This paper provides a theoretical framework, called ``stratified…
We consider growth of local operators under Euclidean time evolution in lattice systems with local interactions. We derive rigorous bounds on the operator norm growth and then proceed to establish an analog of the Lieb-Robinson bound for…
A unified conceptual foundation of classical and quantum physics is given, free of undefined terms. Ensembles are defined by extending the `probability via expectation' approach of Whittle to noncommuting quantities. This approach carries…
Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of…
The quantization of Lorentzian or Euclidean 2+1 gravity by canonical methods is a well-studied problem. However, the constraints of 2+1 gravity are those of a topological field theory and therefore resemble very little those of the…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
Prefix parsing asks whether an input prefix can be extended to a complete string generated by a given grammar. In the weighted setting, it also provides prefix probabilities, which are central to context-free language modeling,…
While there does not at this time exist a complete canonical theory of full 3+1 quantum gravity, there does appear to be a satisfactory canonical quantization of minisuperspace models. The method requires no `choice of time variable' and…
We have run numerical simulations of Euclidean lattice quantum gravity for metrics which are time-independent and spherically symmetric. The radial variable is discretized as $r=hL_{Planck}$, with $h=0,1,...,N$ and $N$ up to $10^5$. The…
We present Decalf, a directed, effectful cost-aware logical framework for studying quantitative aspects of functional programs with effects. Like Calf, the language is based on an internal phase distinction between the behavior of a program…
The most general description of the classical world is in terms of local densities (such as number, momentum, energy), and these typically evolve according to evolution equations of hydrodynamic form. To explain the emergent classicality of…
Grammatical features such as number and gender serve two central functions in human languages. While they encode salient semantic attributes like numerosity and animacy, they also offload sentence processing cost by predictably linking…
We show how it is possible to formulate Euclidean two-dimensional quantum gravity as the scaling limit of an ordinary statistical system by means of dynamical triangulations, which can be viewed as a discretization in the space of…
Canonical formalism of the rank-three tensor model has recently been proposed, in which "local" time is consistently incorporated by a set of first class constraints. By brute-force analysis, this paper shows that there exist only two forms…
We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…
In these two lectures I describe the difficulties one encounters when trying to construct a framework in which to describe topology change in classical general relativity where one sticks to the assumption of an everywhere non-singular…