Related papers: A remark on higher order RUE-resolution with EXTRU…

We give a (consistent) example of a first-countable continuum that is not a remainder of the real line.

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

Milner's complete proof system for observational congruence is crucially based on the possibility to equate $\tau$ divergent expressions to non-divergent ones by means of the axiom $recX. (\tau.X + E) = recX. \tau. E$. In the presence of a…

This short note shows the superconvergence of an $H(\mathrm{grad}\,\mathrm{curl})$-nonconforming brick element very recently introduced in [17] for the quad-curl problem. The supercloseness is based on proper modifications for both the…

This paper defines the (first-order) conflict resolution calculus: an extension of the resolution calculus inspired by techniques used in modern SAT-solvers. The resolution inference is restricted to (first-order) unit-propagation and the…

First-order methods (FOMs) have recently been applied and analyzed for solving problems with complicated functional constraints. Existing works show that FOMs for functional constrained problems have lower-order convergence rates than those…

We provide a counter-example to Proposition 3.2 of "A note on the Fundamental Group of a Triangular Algebra", by F.Xu.

We present an illative system I_s of classical higher-order logic with subtyping and basic inductive types. The system I_s allows for direct definitions of partial and general recursive functions, and provides means for handling functions…

We propose a study of the modes of derivation of higher-order recursion schemes, proving that value trees obtained from schemes using innermost-outermost derivations (IO) are the same as those obtained using unrestricted derivations. Given…

We present an optimization problem in infinite dimensions which satisfies the usual second-order sufficient condition but for which perturbed problems fail to possess solutions.

This paper has been withdrawn by the authors due to a mistake in the proof of the chief result. In particular Theorem 1.3 is correct, while Theorem 1.1 and Theorem 1.2 hold with \mu>0 and a suitable restriction on the exponent p. The proof…

This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…

We consider the uniqueness of solutions of ordinary differential equations where the coefficients may have singularities. We derive upper bounds on the the order of singularities of the coefficients and provide examples to illustrate the…

Non-linear recurrences which generate integers in a surprising way have been studied by many people. Typically people study recurrences that are linear in the highest order term. In this paper I consider what happens when the recurrence is…

We give a counterexample to a recently conjectured variant of the Penrose inequality.

Continual relation extraction (CRE) aims to solve the problem of catastrophic forgetting when learning a sequence of newly emerging relations. Recent CRE studies have found that catastrophic forgetting arises from the model's lack of…

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…

An technically interesting proof of a known theorem.

This paper presents an up-to-date and refined version of the SCL calculus for first-order logic without equality. The refinement mainly consists of the following two parts: First, we incorporate a stronger notion of regularity into…

We consider the problem of computing $\ell$-page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to $\ell$ that avoid the nesting of edges on any of the pages. Inspired…