Cover Image

A Complete Finite Axiomatisation of the Equational Theory of Common Meadows

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bergstra, Jan A, Tucker, John V
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Rings with common division, common meadows and their conditional equational theories
by: Bergstra, Jan A, et al.
Published: (2024)

Fracterm Calculus for Partial Meadows
by: Bergstra, Jan A., et al.
Published: (2025)

On Ambiguity: The case of fraction, its meanings and roles
by: Bergstra, Jan A, et al.
Published: (2026)

A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions
by: Różowski, Wojciech
Published: (2024)

Complete Diagrammatic Axiomatisations of Relative Entropy
by: Sarkis, Ralph, et al.
Published: (2026)

Dichotomy for Axiomatising Inclusion Dependencies on K-Databases
by: Hannula, Miika, et al.
Published: (2026)

A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming
by: Piedeleu, Robin, et al.
Published: (2024)

A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations (Extended Version)
by: Ge, Rui, et al.
Published: (2024)

Axiomatisation for an asynchronous epistemic logic with sending and receiving messages
by: Balbiani, Philippe, et al.
Published: (2025)

Quantitative Monoidal Algebra: Axiomatising Distance with String Diagrams
by: Lobbia, Gabriele, et al.
Published: (2024)

The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete
by: Nakamura, Yoshiki
Published: (2025)

The Pebble-Relation Comonad in Finite Model Theory
by: Montacute, Yoàv, et al.
Published: (2021)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Conditional logic as a short-circuit logic
by: Bergstra, Jan A., et al.
Published: (2023)

Evaluation trees for proposition algebra
by: Bergstra, Jan A., et al.
Published: (2015)

Complete Symmetry Breaking for Finite Models
by: Dančo, Marek, et al.
Published: (2025)

Completeness of Relational Algebra via Cylindric Algebra
by: Laštovička, Jan
Published: (2026)

A Complete Equational Theory for Real-Clifford+CH Quantum Circuits
by: Clément, Alexandre
Published: (2026)

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
by: Różowski, Wojciech, et al.
Published: (2026)

Completeness of Finitely Weighted Kleene Algebra With Tests
by: Sedlár, Igor
Published: (2024)

Completions of Kleene's second model
by: Terwijn, Sebastiaan A.
Published: (2023)

An SMT-LIB Theory of Finite Fields
by: Hader, Thomas, et al.
Published: (2024)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

Ordered Completion for Non-Locally Tight mini-gringo Programs
by: Heuer, Jan
Published: (2025)

A Sound and Complete Substitution Algorithm for Multimode Type Theory: Technical Report
by: Ceulemans, Joris, et al.
Published: (2024)

Experimental Results for Vampire on the Equational Theories Project
by: Janota, Mikoláš
Published: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory
by: Schewe, Klaus-Dieter, et al.
Published: (2025)

A Practical Formalization of Monadic Equational Reasoning in Dependent-type Theory
by: Affeldt, Reynald, et al.
Published: (2023)

Case Study: Saturations as Explicit Models in Equational Theories
by: Janota, Mikoláš, et al.
Published: (2026)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

The Unification Type of an Equational Theory May Depend on the Instantiation Preorder: From Results for Single Theories to Results for Classes of Theories
by: Baader, Franz, et al.
Published: (2026)

Complete representation by partial functions for signatures containing antidomain restriction
by: McLean, Brett
Published: (2023)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

Generalization Problems with Atom-Variables in Languages with Binders and Equational Theories
by: Nantes-Sobrinho, Daniele, et al.
Published: (2025)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Embedded Finite Models Beyond Restricted Quantifier Collapse
by: Benedikt, Michael, et al.
Published: (2023)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)