English
Related papers

Related papers: On extracting variable Herbrand disjunctions

200 papers

First-order resolution has been used for type inference for many years, including in Hindley- Milner type inference, type-classes, and constrained data types. Dependent types are a new trend in functional languages. In this paper, we show…

Logic in Computer Science · Computer Science 2018-05-01 František Farka , Ekaterina Komendantskya , Kevin Hammond

In the paper, by a general and fundamental, but non-extensively circulated, formula for derivatives of a ratio of two differentiable functions and by a recursive relation of the Hessenberg determinant, the author finds a new determinantal…

Combinatorics · Mathematics 2021-12-17 Feng Qi

Building on techniques used in the case of the disc, we use a variety of methods to develop formulae for the adjoints of composition operators on Hardy spaces of the upper half-plane. In doing so, we prove a slight extension of a known…

Functional Analysis · Mathematics 2008-10-14 Sam Elliott

We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…

Probability · Mathematics 2024-10-29 José A. Adell , P. Garrancho , F. J. Martínez-Sánchez

Here we follow the basic analysis that is common for real and complex variables and find how it can be applied to a quaternionic variable. Non-commutativity of the quaternion algebra poses obstacles for the usual manipulations; but we show…

Functional Analysis · Mathematics 2008-04-02 Charles Schwartz

Model structures for many different kinds of functor calculus can be obtained by applying a theorem of Bousfield to a suitable category of functors. In this paper, we give a general criterion for when model categories obtained via this…

Algebraic Topology · Mathematics 2025-11-05 Lauren Bandklayder , Julia E. Bergner , Rhiannon Griffiths , Brenda Johnson , Rekha Santhanam

Distinguished selfadjoint extensions of operators which are not semibounded can be deduced from the positivity of the Schur Complement (as a quadratic form). In practical applications this amounts to proving a Hardy-like inequality.…

Analysis of PDEs · Mathematics 2017-08-23 Maria J. Esteban , Michael Loss

In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…

Logic in Computer Science · Computer Science 2021-10-22 Christoph Wernhard

Motivated by the study of systems of higher order boundary value problems with functional boundary conditions, we discuss, by topological methods, the solvability of a fairly general class of systems of perturbed Hammerstein integral…

Classical Analysis and ODEs · Mathematics 2021-02-09 Gennaro Infante

In this paper, we investigate whether Variational Principles can be associated with the Helmholtz equation subject to impedance (absorbing) boundary conditions. This model has been extensively studied in the literature from both…

Numerical Analysis · Mathematics 2025-11-18 G. Makrakis , C. Makridakis , D. Mitsoudis , M. Plexousakis , T. Pryer

We prove a theorem which implies a quantum (multiplicative) analogue of the Horn conjecture, and also of the saturation conjecture. We obtain transversality statements for quantum schubert calculus in any characteristic and also determine…

Algebraic Geometry · Mathematics 2007-05-23 Prakash Belkale

Most of theoretical physics is based on the mathematics of functions of a real or a complex variable; yet we frequently are drawn to try extending our reach to include quaternions. The non-commutativity of the quaternion algebra poses…

Functional Analysis · Mathematics 2009-11-13 Charles Schwartz

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a…

Logic in Computer Science · Computer Science 2016-02-02 Francesco Alberti , Silvio Ghilardi , Elena Pagani

Goedel's functional "Dialectica" interpretation can be used to extract functional programs from non-constructive proofs in arithmetic by employing two sorts of higher-order witnessing terms: positive realisers and negative counterexamples.…

Logic in Computer Science · Computer Science 2011-01-31 Trifon Trifonov

We present a modification of the superposition calculus that is meant to generate consequences of sets of first-order axioms. This approach is proven to be sound and deductive-complete in the presence of redundancy elimination rules,…

Logic in Computer Science · Computer Science 2014-07-15 Mnacho Echenim , Nicolas Peltier

We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…

Logic in Computer Science · Computer Science 2014-01-20 Stefan Hetzl , Alexander Leitsch , Giselle Reis , Daniel Weller

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

Logic in Computer Science · Computer Science 2012-05-23 Andreas Krebs , Howard Straubing

Herbrand's Fundamental Theorem provides a constructive characterization of derivability in first-order predicate logic by means of sentential logic. Sometimes it is simply called "Herbrand's Theorem", but the longer name is preferable as…

Logic · Mathematics 2015-03-05 Claus-Peter Wirth

We shed new light on Heisenberg's uncertainty principle in the sense of Beurling, by offering an essentially different proof which permits us to weaken the assumptions substantially, and examples show that the result is sharp. The proof…

Functional Analysis · Mathematics 2013-11-11 Haakan Hedenmalm