Problems on the generation of finite models

DOI10.1007/3-540-58156-1_54zbMath1433.68573OpenAlexW1527757483MaRDI QIDQ5210810

Jian Zhang

Publication date: 21 January 2020

Published in: Automated Deduction — CADE-12 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58156-1_54

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Combinatory logic and lambda calculus (03B40) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Uses Software

• FINDER
• SATCHMO

Cites Work

• Unnamed Item
• Problem corner: Robbins algebra: Conditions that make a near-Boolean algebra Boolean
• A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
• On the number of 8\(\times 8\) Latin squares
• Meeting the challenge of fifty years of logic
• The kernel strategy and its use for the study of combinatory logic
• Single axioms for groups and abelian groups with various operations
• Implementing the Davis-Putnam method
• Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
• Tarski's High School Identities

This page was built for publication: Problems on the generation of finite models