Say no to case analysis: automating the drudgery of case-based proofs
From MaRDI portal
Publication:2117657
DOI10.1007/978-3-030-79121-6_2zbMATH Open1495.68126OpenAlexW3176533159MaRDI QIDQ2117657FDOQ2117657
Authors: Jeffrey Shallit 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79121-6_2
Formal languages and automata (68Q45) Combinatorics on words (68R15) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computer assisted proofs of proofs-by-exhaustion type (68V05)
Cites Work
- Title not available (Why is that?)
- Decision procedure for indefinite hypergeometric summation
- Title not available (Why is that?)
- Logic and \(p\)-recognizable sets of integers
- Least Periods of Factors of Infinite Words
- Every Planar Map is Four Colorable
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- On the least number of palindromes contained in an infinite word
- On nonrepetitive sequences
- What is \dots a Wilf-Zeilberger pair?
- Proofs from THE BOOK
- A Sequence Without Repeats on x, x -1 , y, y -1
- Title not available (Why is that?)
- Additive number theory via automata theory
- Every positive integer is a sum of three palindromes
- Sums of Palindromes: an Approach via Automata
- Title not available (Why is that?)
- Composition and orbits of language operations: finiteness and upper bounds
Uses Software
This page was built for publication: Say no to case analysis: automating the drudgery of case-based proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117657)
