Publication:3894959
From MaRDI portal
zbMath0448.68021MaRDI QIDQ3894959
Alfredo Ferro, Eugenio Giovanni Omodeo
Publication date: 1978
programming languagesefficient algorithmsdecision proceduremulti-level syllogisticsAristotelian two-level syllogisticformulae of quantifier-free theoriesvalidity test for formulae in extensional two-level syllogistic
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Theory of software (68N99) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)
Related Items
The automation of syllogistic. I: Syllogistic normal forms, A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case, The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations