Related papers: A note on Hjorth's oscillation theorem
I expound here in a more detailed way a proof of an important Serini's theorem, which I have already sketched in a previous Note. Two related questions are briefly discussed.
In their recent paper [Phys. Rev. Lett. 98, 094101 (2007)], A. Porporato et al. studied the irreversibility and fluctuation theorem for stationary time series. In this comment, we point out that the fluctuation theorem is in fact the…
We provide sufficient criteria for the oscillation of all solutions of neutral delay differential equations of the form \[ \left[x(t) - \sum_{i=1}^{N_r}R_i(t)x(t - r_i(t)) \right]' + \sum_{i=1}^{N_p}P_i(t)x(t - \tau_i(t)) -…
Newtons Laws of Motion form the basis of classical mechanics, but misconceptions about their interrelationships persist in pedagogy. A prevalent misunderstanding is that Newtons First Law is a trivial consequence of the Second Law. This…
We present a new proof of a primality criterion first proved by Emmanuel Vantieghem.
We prove a logical implication between two old conjectures stated by Bapat and Sunder about the permanent of positive semidefinite matrices. Although Drury has recently disproved both conjectures, this logical implication yields a…
We present a new proof of the celebrated quadratic reciprocity law. Our proof is based on group theory.
The jiggling lemma of Thurston shows that any triangulation can be jiggled (read: subdivided and then perturbed) to be in general position with respect to a distribution. Our main result is a generalization of Thurston's lemma. It states…
Most discussions of G\"odel's theorems fall into one of two types: either they emphasize perceived philosophical, cultural "meanings" of the theorems, and perhaps sketch some of the ideas of the proofs, usually relating G\"odel's proofs to…
This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
This paper has two goals. The first goal is to show how an extension of second-order logic is a natural framework to formalize portions of Aristotle's \emph{Topics} and to bring to the foreground the logical, linguistic and philosophical…
We study and describe possibilities for arities of elementary theories and of their expansions. Links for arities with respect to Boolean algebras, to disjoint unions and to compositions of structures are shown. The dynamics for arities of…
First-Order Logic (FOL) is widely regarded as one of the most important foundations for knowledge representation. Nevertheless, in this paper, we argue that FOL has several critical issues for this purpose. Instead, we propose an…
We find the order of Whitney's constants for oscillating functions
Motivation and perspective for an exciting new research direction interconnecting logic, spacetime theory, relativity--including such revolutionary areas as black hole physics, relativistic computers, new cosmology--are presented in this…
In this paper we firstly review how to \textit{explicitly} solve a system of $3$ \textit{first-order linear recursions }and outline the main properties of these solutions. Next, via a change of variables, we identify a class of systems of…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…