English
Related papers

Related papers: Boole's Method I. A Modern Version

200 papers

Translation of the Latin original, "Methodus generalis investigandi radices omnium aequationum per approximationem" (1776). E643 in the Enestrom index. Euler gives a series to find powers of roots of polynomials.

History and Overview · Mathematics 2007-06-21 Leonhard Euler

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

Motivated by classical vortex blob methods for the Euler equations, we develop a numerical blob method for the aggregation equation. This provides a counterpoint to existing literature on particle methods. By regularizing the velocity field…

Numerical Analysis · Mathematics 2014-05-27 Katy Craig , Andrea L. Bertozzi

We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…

Commutative Algebra · Mathematics 2025-02-20 Katelyn S. Clark , Pace P. Nielsen

In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…

Quantum Physics · Physics 2009-12-22 G. Domenech , H. Freytes , C. de Ronde

In this paper, we investigate the potential of the Boyer-Moore waterfall model for the automation of inductive proofs within a modern proof assistant. We analyze the basic concepts and methodology underlying this 30-year-old model and…

Logic in Computer Science · Computer Science 2018-08-14 Petros Papapanagiotou , Jacques Fleuriot

This paper was written in 1994 and has attracted a large number of citations since then. The main result was a definition of what is called the affine Brauer algebra in the present version. It is now posted to affirm this terminology.

Representation Theory · Mathematics 2024-04-03 Maxim Nazarov

A short introduction to the mathematical methods and technics of differential algebras and modules adapted to the problems of mathematical and theoretical physics is presented.

Rings and Algebras · Mathematics 2018-08-29 Victor Zharinov

This work contributes to the domains of Boolean algebra and of Bayesian probability, by proposing an algebraic extension of Boolean algebras, which implements an operator for the Bayesian conditional inference and is closed under this…

Logic · Mathematics 2011-12-19 Frederic Dambreville

We begin the systematic model theoretic study of $\mathrm{C}^*$-algebras using the tools of continuous logic.

Logic · Mathematics 2018-04-17 I. Farah , B. Hart , M. Lupini , L. Robert , A. Tikuisis , A. Vignati , W. Winter

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Logic · Mathematics 2017-01-05 Daniel Murfet

This paper is an informal survey of some of the deep connections between logic and optimization. It covers George Boole's probability logic, decision diagrams, logic and cutting planes, first order predicate logic, default and nonmonotonic…

Logic · Mathematics 2019-10-31 John Hooker

Boole polynomials play an important role in the area of number theory, algebra and umbral calculus. In this paper, we investigate some properties of Boole polynomials and consider Witt-type formulas for the Boole numbers and polynomials.…

Number Theory · Mathematics 2013-10-31 Dae San Kim , Taekyun Kim

In this paper you can explore the application of some notable Boolean-derived methods, namely the Disjunctive Normal Form representation of logic table expansions, and extend them to a real-valued logic model which is able to utilize…

Artificial Intelligence · Computer Science 2019-11-11 Jonathan Darren Nix

This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…

Logic · Mathematics 2020-06-11 Tommaso Flaminio , Lluis Godo , Hykel Hosni

We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Achim Blumensath

We provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories. We illustrate our methodology by means of two applications: a rational reconstruction of Birkhoff's Equational Logic and a new…

Logic in Computer Science · Computer Science 2015-07-01 Marcelo Fiore , Chung-Kil Hur

A detailed and rigorous analysis of G\"odel's proof of his first incompleteness theorem is presented. The purpose of this analysis is two-fold. The first is to reveal what G\"odel actually proved to provide a clear and solid foundation upon…

Logic · Mathematics 2020-04-30 Jason W. Steinmetz

We analyze the behavior of polarized complex variations of Hodge structure on the punctured unit disk. For integral variations of Hodge structure, this analysis was first carried out by Wilfried Schmid. We get rid of the assumption that the…

Algebraic Geometry · Mathematics 2024-11-27 Claude Sabbah , Christian Schnell

In this course we introduce the main notions relative to the classical theory of modular forms. A complete treatise in a similar style can be found in the author's book joint with F. Str{\"o}mberg [1].

Number Theory · Mathematics 2018-10-01 Henri Cohen