Schönfinkel-type operators for classical logic (Q993497): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11225-010-9265-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2038039539 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatory logic. With two sections by William Craig. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatory logic. Vol. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Function Algebras on Finite Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3077969 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Post's functional completeness theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5650663 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3283891 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4357731 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:19, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Schönfinkel-type operators for classical logic |
scientific article |
Statements
Schönfinkel-type operators for classical logic (English)
0 references
20 September 2010
0 references
The author defines a new operator, dual to Schönfinkel's one, and proves that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic. It is shown that there are four binary operators such that each can serve as the only undefined logical constant for classical first-order logic and that, for every \(n\)-ary connective that yields a functionally complete singleton set of connectives, two Schönfinkel-type operators are definable, and all the latter ones are definable in this way.
0 references
functional completeness
0 references
sufficient sets of operators
0 references
quantifiers
0 references
Peirce
0 references
Sheffer
0 references
Post
0 references
Schönfinkel.
0 references