Related papers: A proof-theoretical approach to some extensions of…
In this note we study inverse spectral problems for canonical Hamiltonian systems, which encompass a broad class of second order differential equations on a half-line. Our goal is to extend the classical resultss developed in the work of…
G\"unter Asser (1981) introduced second-order permutation models. In this way, the Fraenkel-Mostowski-Specker method for defining models of ZFA was transferred to a new application area. To investigate the strength of second-order…
This talk is a sneak preview of the project, 'proof theory for theories of ordinals'. Background, aims, survey and furture works on the project are given. Subsystems of second order arithmetic are embedded in recursively large ordinals and…
This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.
The completeness of the group classification of systems of two linear second-order ordinary differential equations with constant coefficients is delineated in the paper. The new cases extend what has been done in the literature. These cases…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
We consider a binary statistical hypothesis testing problem, where $n$ independent and identically distributed random variables $Z^n$ are either distributed according to the null hypothesis $P$ or the alternate hypothesis $Q$, and only $P$…
We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the…
We show that each level of the quantifier alternation hierarchy within FO^2[<] -- the 2-variable fragment of the first order logic of order on words -- is a variety of languages. We then use the notion of condensed rankers, a refinement of…
We focus in this paper on generating models of quantified first-order formulas over built-in theories, which is paramount in software verification and bug finding. While standard methods are either geared toward proving the absence of…
Quantifier-elimination or model-completeness of the affine part of some classical first order theories are proved.
The "quantum duality principle" states that a quantisation of a Lie bialgebra provides also a quantisation of the dual formal Poisson group and, conversely, a quantisation of a formal Poisson group yields a quantisation of the dual Lie…
We introduce a proof-theoretic approach to showing nondefinability of second-order intuitionistic connectives by quantifier-free schemata. We apply the method to prove that Taranovsky's "realizability disjunction" connective does not admit…
A general method is developed for deriving Quantum First and Second Fundamental Theorems of Coinvariant Theory from classical analogs in Invariant Theory, in the case that the quantization parameter q is transcendental over a base field.…
In this paper we establish a general form of the Mass Transference Principle for systems of linear forms conjectured in [1]. We also present a number of applications of this result to problems in Diophantine approximation. These include a…
Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations. In this work, we supply logical foundations to this practice,…
We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…
While in first and second quantization the fundamental operators are respectively coordinates and fields (functions), an extension of quantum field theory can be achieved if the usual pair of conjugate momenta is represented by functionals.…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…