Definability of Boolean functions in Kripke semantics (Q6187418): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Deriving Natural Deduction Rules from Truth Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical connectives for intuitionistic propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the independence of the primitive symbols of Heyting's calculus of propositions / 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: Sequents in many valued logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effect of the choice of connectives on the relation between classical logic and intuitionistic logic / rank
 
Normal rank

Latest revision as of 09:37, 23 August 2024

scientific article; zbMATH DE number 7787874
Language Label Description Also known as
English
Definability of Boolean functions in Kripke semantics
scientific article; zbMATH DE number 7787874

    Statements

    Identifiers