English
Related papers

Related papers: One is all you need: Second-order Unification with…

200 papers

Extrapolating the coupling strengths to very high energies, one finds that they do not converge to a single coupling constant, as expected in the simplest gauge theory of Grand Unification, the SU(5) theory. We find that the coupling…

High Energy Physics - Phenomenology · Physics 2007-05-23 Alp Deniz Özer , Harald Fritzsch

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…

Logic in Computer Science · Computer Science 2010-12-23 Sunil Kothari , James Caldwell

We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…

Logic in Computer Science · Computer Science 2023-06-22 Andreas Krebs , Kamal Lodaya , Paritosh K. Pandya , Howard Straubing

We consider the second-order cone function (SOCF) $f: {\mathbb R}^n \to \mathbb R$ defined by $f(x)= c^T x + d -\|A x + b \|$. Every SOCF is concave. We give necessary and sufficient conditions for strict concavity of $f$. The parameters $A…

Optimization and Control · Mathematics 2024-05-09 Shafiu Jibrin , James W. Swift

When the electroweak action is rewritten in terms of SU(2) gauge invariant variables, the Higgs can be interpreted as a conformal metric factor. We show that asymptotic flatness of the metric is required to avoid a Gribov problem: without…

High Energy Physics - Theory · Physics 2010-07-12 Anton Ilderton , Martin Lavelle , David McMullan

The hypercharges of the fermions are not uniquely determined in SO(10) grand unification, but rather depend upon which linear combination of the two U(1) subgroups of SO(10) > SU(3) X SU(2) X U(1) X U(1) remains unbroken. We show that, in…

High Energy Physics - Phenomenology · Physics 2009-10-30 J. Lykken , T. Montroy , S. Willenbrock

Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…

Logic in Computer Science · Computer Science 2017-06-14 Marco Voigt

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

Logic in Computer Science · Computer Science 2025-08-18 Louwe Kuijer , Tony Tan , Frank Wolter , Michael Zakharyaschev

The uniform one-dimensional fragment U1 is a recently introduced extension of the two-variable fragment FO2. The logic U1 enables the use of relation symbols of all arities and thereby extends the scope of applications of FO2. In this…

Logic · Mathematics 2018-12-21 Jonne Iso-Tuisku , Antti Kuusisto

In the context of supersymmetric $SO(10)$ grand unified models, it is shown that the gauge symmetry breaking as well as a natural doublet--triplet splitting can be achieved with a minimal Higgs system consisting of a single adjoint and a…

High Energy Physics - Phenomenology · Physics 2011-05-12 K. S. Babu , S. M. Barr

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

Logic in Computer Science · Computer Science 2025-04-18 Zhibo Chen , Frank Pfenning

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

We construct the general form of an F-theory compactification with two U(1) factors based on a general elliptically fibered Calabi-Yau manifold with Mordell-Weil group of rank two. This construction produces broad classes of models with…

High Energy Physics - Theory · Physics 2016-01-27 Mirjam Cvetic , Denis Klevers , Hernan Piragua , Washington Taylor

We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix…

Logic in Computer Science · Computer Science 2021-01-08 Isolde Adler , Noleen Köhler , Pan Peng

We consider periodic homogenization of boundary value problems for second-order semilinear elliptic systems in 2D of the type $$ \partial_{x_i}\left(a_{ij}^{\alpha…

Analysis of PDEs · Mathematics 2025-02-26 Nikolai N. Nefedov , Lutz Recke

We analyze the gauge unification in minimal supersymmetric SO(10) grand unified theories in 5 dimensions. The single extra spatial dimension is compactified on the orbifold S^1/(Z_2 x Z_2') reducing the gauge group to that of Pati-Salam…

High Energy Physics - Phenomenology · Physics 2009-11-11 Maria Laura Alciati , Yin Lin

The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…

Logic in Computer Science · Computer Science 2019-11-27 Marco Voigt

The boundary conditions on multiply connected extra dimensions play major rolls in gauge-Higgs unification theory. Different boundary conditions, having been given in ad hoc manner so far, lead to different theories. To solve this…

High Energy Physics - Theory · Physics 2014-04-11 Kengo Yamamoto

We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…

Logic in Computer Science · Computer Science 2022-07-12 Julien Grange

Contexts are terms with one `hole', i.e. a place in which we can substitute an argument. In context unification we are given an equation over terms with variables representing contexts and ask about the satisfiability of this equation.…

Logic in Computer Science · Computer Science 2013-11-11 Artur Jeż