Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present

DOI10.1002/cpa.3160400302zbMath0656.03007OpenAlexW2051575254MaRDI QIDQ3803085

Alfredo Ferro, Eugenio Giovanni Omodeo

Publication date: 1987

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://archive.org/details/decisionprocedur00ferr

zbMATH Keywords

choice operatorfinite setsdecision algorithmunquantified theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Set theory (03E99)

Related Items (1)

The automation of syllogistic. I: Syllogistic normal forms

Cites Work

• The axiom of choice

This page was built for publication: Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present