English
Related papers

Related papers: An Initial Algebra Theorem Without Iteration

200 papers

Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…

Logic in Computer Science · Computer Science 2026-05-06 Go Hashimoto

We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…

Classical Analysis and ODEs · Mathematics 2023-01-18 Oleg Zubelevich

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

Functional Analysis · Mathematics 2010-10-05 Daniel A. Spielman , Nikhil Srivastava

In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…

Rings and Algebras · Mathematics 2024-02-29 Bamdad R. Yahaghi

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

Classical Analysis and ODEs · Mathematics 2020-09-28 Soham Basu

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2025-01-16 Andrei A. Bulatov

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Rings and Algebras · Mathematics 2007-05-23 Constantin M. Petridi , P. B. Krikelis

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

Number Theory · Mathematics 2015-10-06 Samrith Ram

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Logic in Computer Science · Computer Science 2018-10-11 Ruben Gamboa , John Cowles

Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras…

Rings and Algebras · Mathematics 2015-03-06 Jason P. Bell , Blake W. Madill

We consider a class of formula equations in first-order logic, Horn formula equations, which are defined by a syntactic restriction on the occurrences of predicate variables. Horn formula equations play an important role in many…

Logic in Computer Science · Computer Science 2025-11-12 Stefan Hetzl , Johannes Kloibhofer

Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…

Formal Languages and Automata Theory · Computer Science 2025-06-09 Anton Chernev , Corina Cîrstea , Helle Hvid Hansen , Clemens Kupke

We examine recursive monotonic functions on the Lindenbaum algebra of $\mathsf{EA}$. We prove that no such function sends every consistent $\varphi$ to a sentence with deductive strength strictly between $\varphi$ and…

Logic · Mathematics 2019-10-22 Antonio Montalbán , James Walsh

We consider two endofunctors of the form $~F:X\longrightarrow M\otimes X~$, where $~M~$ is a non degenerate module, related to the unit interval and the Sierpinski gasket, and their final co-algebras. The functors are defined on the…

Category Theory · Mathematics 2017-10-23 Annanthakrishna Manokaran , Romaine Jayewardene , Jayampathy Ratnayake

We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is…

Other Computer Science · Computer Science 2018-09-25 Christian Matt , Ueli Maurer , Christopher Portmann , Renato Renner , Björn Tackmann

A compact T-algebra is an initial T-algebra whose inverse is a final T-coalgebra. Functors with this property are said to be algebraically compact. This is a very strong property used in programming semantics which allows one to interpret…

Logic in Computer Science · Computer Science 2020-09-16 Vladimir Zamdzhiev

We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…

Logic · Mathematics 2021-07-07 Anton Freund

A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…

Rings and Algebras · Mathematics 2023-03-03 Clément de Seguins Pazzis

We investigate some Weihrauch problems between $\mathsf{ATR}_2$ and $\mathsf{C}_{\omega^\omega}$ . We show that the fixed point theorem for monotone operators on the Cantor space (a weaker version of the Knaster-Tarski theorem) is not…

Logic · Mathematics 2024-06-11 Yudai Suzuki , Keita Yokoyama

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson