Say no to case analysis: automating the drudgery of case-based proofs
type: Item
instance of: scholarly article
title: Say no to case analysis: automating the drudgery of case-based proofs
zbMATH Open document ID: 1495.68126
DOI: 10.1007/978-3-030-79121-6_2
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68V05
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7495101
zbMATH Keywords: decision procedure
zbMATH Keywords: automata
zbMATH Keywords: case-based proof
zbMATH Keywords: algorithm
author: Jeffrey Shallit
describes a project that uses: Walnut
MaRDI profile type: Publication
full work available at URL: 978-3-030-79121-6 2
OpenAlex ID: W3176533159
cites work: Proofs from THE BOOK
cites work: Every Planar Map is Four Colorable
cites work: Logic and \(p\)-recognizable sets of integers
cites work: Composition and orbits of language operations: finiteness and upper bounds
cites work: Every positive integer is a sum of three palindromes
cites work: Least Periods of Factors of Infinite Words
cites work: A Sequence Without Repeats on x, x -1 , y, y -1
cites work: On nonrepetitive sequences
cites work: On the least number of palindromes contained in an infinite word
cites work: Decision procedure for indefinite hypergeometric summation
cites work: Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
cites work: Q4970126
cites work: Q5005118
cites work: Q4875364
cites work: Additive number theory via automata theory
cites work: Sums of Palindromes: an Approach via Automata
cites work: Q5710443
cites work: Q3561297
description: scientific article; zbMATH DE number 7495101