Turning the Liar paradox into a metatheorem of Basic logic

We show that self-reference can be formalized in Basic logic by means of the new connective @, called "entanglement". In fact, the property of non-idempotence of the connective @ is a metatheorem, which states that a self-entangled sentence loses its own identity. This prevents having self-referential paradoxes in the corresponding metalanguage. In this context, we introduce a generalized definition of self-reference, which is needed to deal with the multiplicative connectives of substructural logics.

[1]  J. Bell,et al.  Speakable and Unspeakable in Quatum Mechanics , 1988 .

[2]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[3]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[4]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[5]  A. Shimony,et al.  Bell’s theorem without inequalities , 1990 .

[6]  Basic logic and quantum entanglement , 2006, quant-ph/0611119.

[7]  A. R. Turquette,et al.  Logic, Semantics, Metamathematics , 1957 .

[8]  P. Dangerfield Logic , 1996, Aristotle and the Stoics.

[9]  R. Jozsa,et al.  On the role of entanglement in quantum-computational speed-up , 2002, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[10]  S. Braunstein,et al.  Impossibility of deleting an unknown quantum state , 2000, Nature.

[11]  Anthony Hunter,et al.  Paraconsistent logics , 1998 .

[12]  Claudia Faggian,et al.  From Basic Logic to Quantum Logics with Cut-Elimination , 1998 .

[13]  Claudia Faggian,et al.  Basic logic: reflection, symmetry, visibility , 2000, Journal of Symbolic Logic.

[14]  A. Zeilinger,et al.  Speakable and Unspeakable in Quantum Mechanics , 1989 .