Computer proofs about finite and regular sets: The unifying concept of subvariance.
type: Item
instance of: scholarly article
title: Computer proofs about finite and regular sets: The unifying concept of subvariance.
zbMATH Open document ID: 1039.68115
DOI: 10.1016/S0747-7171(03)00023-3
author: Johan Gijsbertus Frederik Belinfante
published in: Journal of Symbolic Computation
publication date: 2003-08-25T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 1970579
zbMATH Keywords: Finite
zbMATH Keywords: Regularity
zbMATH Keywords: Subvariance
describes a project that uses: Metamath
describes a project that uses: OTTER
MaRDI profile type: Publication
cites work: Q3992552
cites work: Q3993251
cites work: Computer proofs in Gödel's class theory with equational definitions for composite and cross
cites work: On computer-assisted proofs in ordinal number theory
cites work: Q2723414
cites work: Axiomatic set theory. With a historical introduction by Abraham A. Fraenkel
cites work: Set theory in first-order logic: Clauses for Gödel's axioms
cites work: Consistency of the Continuum Hypothesis. (AM-3)
cites work: Q4256417
cites work: A Definition of Ordinal Numbers
cites work: Q5598318
cites work: Experimenting with Isabelle in ZF set theory
cites work: Mechanizing set theory. Cardinal arithmetic and the axiom of choice
cites work: Automated deduction in von Neumann-Bernays-Gödel set theory
cites work: Q4032144
cites work: A theorem on n-tuples which is equivalent to the well-ordering theorem
cites work: On equivalents of well-foundedness. An experiment in MIZAR
full work available at URL: s0747-7171(03)00023-3
OpenAlex ID: W2027206952
description: scientific article; zbMATH DE number 1970579