English
Related papers

Related papers: Formalising Sylow's theorems in Coq

200 papers

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 describe a self-consistent canonical quantization of Liouville theory in terms of canonical free fields. In order to keep the non-linear Liouville dynamics, we use the solution of the Liouville equation as a canonical transformation.…

High Energy Physics - Theory · Physics 2008-02-03 Gerhard Weigt

PyLog is a minimal experimental proof assistant based on linearised natural deduction for intuitionistic and classical first-order logic extended with a comprehension operator. PyLog is interesting as a tool to be used in conjunction with…

Logic · Mathematics 2023-06-06 Clarence Lewis Protin

The novel notion of rigid commutators is introduced to determine the sequence of the logarithms of the indices of a certain normalizer chain in the Sylow 2-subgroup of the symmetric group on 2^n letters. The terms of this sequence are…

Group Theory · Mathematics 2022-05-25 Riccardo Aragona , Roberto Civino , Norberto Gavioli , Carlo Maria Scoppola

This paper describes a formal theory of smooth vector fields, Lie groups and the Lie algebra of a Lie group in the theorem prover Isabelle. Lie groups are abstract structures that are composable, invertible and differentiable. They are…

Logic in Computer Science · Computer Science 2024-07-30 Richard Schmoetten , Jacques D. Fleuriot

In this article we study the Galois group of field generated by division points of special class of formal group laws and prove an equivalent condition for the group to be abelian. Further, we explore relations between the endomorphism ring…

Number Theory · Mathematics 2019-01-23 Soumyadip Sahu

The symplectic and Poisson structures of the Liouville theory are derived from the symplectic form of the SL(2,R) WZNW theory by gauge invariant Hamiltonian reduction. Causal non-equal time Poisson brackets for a Liouville field are…

High Energy Physics - Theory · Physics 2009-11-07 George Jorjadze , Gerhard Weigt

This paper explains some of the ideas behind a prior joint work of the author with Bruce Driver on the canonical quantization of Yang-Mills theory on a spacetime cylinder. The idea is that the generalized Segal-Bargmann transform for a…

Quantum Physics · Physics 2007-05-23 Brian C. Hall

While teaching untyped $\lambda$-calculus to undergraduate students, we were wondering why $\alpha$-equivalence is not directly inductively defined. In this paper, we demonstrate that this is indeed feasible. Specifically, we provide a…

Logic in Computer Science · Computer Science 2026-01-16 Kalmer Apinis , Danel Ahman

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

Number Theory · Mathematics 2025-04-24 Fabrice Etienne

Topos theory has been suggested by D\"oring and Isham as an alternative mathematical structure with which to formulate physical theories. In particular, the topos approach suggests a radical new way of thinking about what a theory of…

Mathematical Physics · Physics 2011-06-30 Cecilia Flori

There is a long tradition of fruitful interaction between logic and social choice theory. In recent years, much of this interaction has focused on computer-aided methods such as SAT solving and interactive theorem proving. In this paper, we…

Logic in Computer Science · Computer Science 2021-10-19 Wesley H. Holliday , Chase Norman , Eric Pacuit

This work presents a formalization of the theorem of existence of most general unifiers in first-order signatures in the higher-order proof assistant PVS. The distinguishing feature of this formalization is that it remains close to the…

Logic in Computer Science · Computer Science 2012-03-29 Andréia B Avelar , André L Galdino , Flávio LC de Moura , Mauricio Ayala-Rincón

Chemical theory can be made more rigorous using the Lean theorem prover, an interactive theorem prover for complex mathematics. We formalize the Langmuir and BET theories of adsorption, making each scientific premise clear and every step of…

Logic in Computer Science · Computer Science 2023-12-14 Maxwell P. Bobbin , Samiha Sharlin , Parivash Feyzishendi , An Hong Dang , Catherine M. Wraback , Tyler R. Josephson

We develop a Galois theory for systems of linear difference equations with an action of an endomorphism {\sigma}. This provides a technique to test whether solutions of such systems satisfy {\sigma}-polynomial equations and, if yes, then…

Commutative Algebra · Mathematics 2020-11-17 Alexey Ovchinnikov , Michael Wibmer

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…

Logic in Computer Science · Computer Science 2023-06-22 Xavier Allamigeon , Ricardo D. Katz , Pierre-Yves Strub

A coarse graining operation of spatially homogeneous quantum states based on an SU(1,1) Lie group structure has recently been proposed in [1] and used in [2] to compute an explicit renormalisation group flow in the context of loop quantum…

General Relativity and Quantum Cosmology · Physics 2021-07-07 Norbert Bodendorfer , Fabian Haneder

We relate two different proposals to extend the \'etale topology into homotopy theory, namely via the notion of finite cover introduced by Mathew and via the notion of separable commutative algebra introduced by Balmer. We show that finite…

Algebraic Topology · Mathematics 2025-05-29 Niko Naumann , Luca Pol

We develop a Galois theory of commutative rings under actions of finite inverse semigroups. We present equivalences for the definition of Galois extension as well as a Galois correspondence theorem. We also show how the theory behaves in…

Rings and Algebras · Mathematics 2025-01-03 Wesley G. Lautenschlaeger , Thaísa Tamusiunas

Several approaches exist to data-mining big corpora of formal proofs. Some of these approaches are based on statistical machine learning, and some -- on theory exploration. However, most are developed for either untyped or simply-typed…

Programming Languages · Computer Science 2017-05-23 Ekaterina Komendantskaya , Jonathan Heras
‹ Prev 1 8 9 10 Next ›