Related papers: Permutation Models of Second Order
We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles. Our logic…
Two new formulations of general relativity are introduced. The first one is a parabolization of the Arnowitt, Deser, Misner (ADM) formulation and is derived by addition of combinations of the constraints and their derivatives to the…
Ramanujan introduced mock theta functions in his last letter to G.H.Hardy. He provided examples and various relations between them. G.N.Watson found transformations for the third order mock theta functions $f(q)$ and $\omega$(q). Zwegers in…
We introduce $\mathsf{LEM}$, a type-assignment system for the linear $ \lambda $-calculus that extends second-order $\mathsf{IMLL}_2$, i.e., intuitionistic multiplicative Linear Logic, by means of logical rules that weaken and contract…
We investigate how the sentence choice semantics (SCS) for propositional superposition logic (PLS) developed in \cite{Tz17} could be extended so as to successfully apply to first-order superposition logic(FOLS). There are two options for…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
This paper investigates the learning of 3rd-order tensors representing the semantics of transitive verbs. The meaning representations are part of a type-driven tensor-based semantic framework, from the newly emerging field of compositional…
We describe a new method for finding patterns in permutations that produce a given pattern after the permutation has been passed once through a stack. We use this method to describe West-3-stack-sortable permutations, that is, permutations…
This lecture presents recent advances in the theory of errors propagation. We first explain in which cases the propagation of errors may be performed with a first order differential calculus or needs a second order differential calculus.…
We show that the Peiffer commutator previously defined by Cigoli, Mantovani and Metere can be used to characterize central extensions of precrossed modules with respect to the subcategory of crossed modules in any semi-abelian category…
In 1981, Takeuti introduced quantum set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed linear subspaces of a Hilbert space in a manner analogous to Boolean-valued models of set…
We consider the quantifier alternation hierarchy within two-variable first-order logic FO^2[<,suc] over finite words with linear order and binary successor predicate. We give a single identity of omega-terms for each level of this…
This article reformulates the theory of computable physical models, previously introduced by the author, as a branch of applied model theory in first-order logic. It provides a semantic approach to the philosophy of science that…
We aim to provide a family of Drinfeld-Hecke eigenforms given in terms of a determinant of twisted Eisenstein series. Our main tool is the theory of vectorial Drinfeld modular forms, previously introduced by Pellarin [18] and extensively…
Bisimulation equivalence (or bisimilarity) of first-order grammars is decidable, as follows from the decidability result by Senizergues (1998, 2005) that has been given in an equivalent framework of equational graphs with finite out-degree,…
We consider second order explicit and implicit two-step time-discrete schemes for wave-type equations. We derive optimal order aposteriori estimates controlling the time discretization error. Our analysis, has been motivated by the need to…
Learning distributions over permutations is a fundamental problem in machine learning, with applications in ranking, combinatorial optimization, structured prediction, and data association. Existing methods rely on mixtures of parametric…
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…
A general approach to transference principles for discrete and continuous operator (semi)groups is described. This allows to recover the classical transference results of Calder\'on, Coifman and Weiss and of Berkson, Gillespie and Muhly and…
\v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la [J. Math. Phys. \textbf{44}, 962 - 968 (2003)] introduced in connection with the summation of the divergent perturbation expansion of the hydrogen atom in an external magnetic field a new sequence…