On η-valued functionally complete truth functions

1967 ◽  
Vol 32 (2) ◽  
pp. 190-195 ◽  
Author(s):  
R. L. Graham

It is well known that the familiar Sheffer stroke function of the 2-valued propositional calculus is functionally complete (i.e., for any m, all 22m truth functions of m variables can be defined1 in terms of the stroke function). Indeed, it is not difficult to show that of the 16 2-valued functions of two variables, exactly two of them are functionally complete.

2004 ◽  
Vol 11 (4) ◽  
pp. 753-758
Author(s):  
A. Kharazishvili

Abstract For a given σ-ideal of sets, the notion of a generalized stepfunction is introduced and investigated in connection with the problem of sup-measurability of certain functions of two variables, regarded as superposition operators.


2015 ◽  
Vol 38 ◽  
pp. 57-86 ◽  
Author(s):  
Rafael Martínez-Planell ◽  
Maria Trigueros Gaisman ◽  
Daniel McGee

2011 ◽  
Vol 21 (4) ◽  
pp. 671-677 ◽  
Author(s):  
GÉRARD HUET

This special issue of Mathematical Structures in Computer Science is devoted to the theme of ‘Interactive theorem proving and the formalisation of mathematics’.The formalisation of mathematics started at the turn of the 20th century when mathematical logic emerged from the work of Frege and his contemporaries with the invention of the formal notation for mathematical statements called predicate calculus. This notation allowed the formulation of abstract general statements over possibly infinite domains in a uniform way, and thus went well beyond propositional calculus, which goes back to Aristotle and only allowed tautologies over unquantified statements.


Sign in / Sign up

Export Citation Format

Share Document