TYPE-QUANTIFIER CALCULUS OF POSITIVELY-FORMED FORMULAS WITH NEGATIONS
Type quantifier language and calculus as logical positively-constructed means of knowledge representation and automation of deductive inference have been developed. In them, the type conditions of quantifiers can contain negations, and the calculus has completeness with respect to derivability in the classical predicate calculus.
Authors
- S. N. Vassilyev
Publication Details
- Journal
- Доклады Российской академии наук Математика информатика процессы управления / Doklady Mathematics
- Published
- 2025-01-01
- DOI
- https://doi.org/10.7868/s3034504925030031
- Primary Topic
- Advanced Algebra and Logic
- Type
- article
- Field-Weighted Citation Impact
- 0.00