Related papers: A note on Hjorth's oscillation theorem
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
We derive the Helmholtz theorem for Hamiltonian systems defined on time scales in the context of nonshifted calculus of variations which encompass the discrete and continuous case. Precisely, we give a theorem characterizing first order…
In these notes we propose a new, simpler proof system for first-order matching logic with application and definedness. The new proof system is inspired by Tarski's axiomatization for first order-logic with equality (simplified by Kalish and…
The conformal equivalence of fourth-order gravity following from a non-linear Lagrangian L(R) to theories of other types is widely known, here we report on a new conformal equivalence of these theories to theories of the same type but with…
This is a celebratory and pedagogical discussion of Sturm oscillation theory. Included is the discussion of the difference equation case via determinants and a renormalized oscillation theorem of Gesztesy, Teschl, and the author.
By a result known as Rieger's theorem (1956), there is a one-to-one correspondence, assigning to each cyclically ordered group $H$ a pair $(G,z)$ where $G$ is a totally ordered group and $z$ is an element in the center of $G$, generating a…
We give a brief historical overview of the famous Pythagoras' theorem and Pythagoras. We present a simple proof of the result and dicsuss some extensions. We follow \cite{thales}, \cite{wiki} and \cite{wiki2} for the historical comments and…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
This paper is based on MacColl's [1] solution of the equation of motion for a linear (harmonic) oscillator subject to the laws of special relativity in the rest frame of the center of attraction. MacColl's result can be extended to the…
For the generalized oscillator, we prove a Rellich type theorem, or characterize the order of growth of eigenfunctions. The proofs are given by an extensive use of commutator arguments invented recently by Ito and Skibsted. These arguments…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
The first version of this paper gave another proof of the Kropholler Conjecture, which gives a relative version of Stallings Ends Theorem, following an earlier incorrect proof. It has been pointed out by Sam Shepherd that the the second…
A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
This paper formalize the existence's proof of first-integrals for any second order ODE, allowing to discriminate periodic orbits. Up to the author's knowledge, such a powerful result is not available in the literature providing a tool to…
Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…
A concise presentation of Schrodinger's ancilla theorem (1936 Proc. Camb. Phil. Soc. 32, 446) and its several recent rediscoveries.
This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.
Herbrand's Theorem is a fundamental result in mathematical logic which provides a reduction of first-order formulas satisfied by a universal class to formulas free of existential quantifiers. In this work, a simpler and self-contained…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…