# Transcendental syntax 2 . 0

@inproceedings{Girard2012TranscendentalS2, title={Transcendental syntax 2 . 0}, author={J. Girard}, year={2012} }

How come that finite language can produce certainty — at least a sufficiently certain certainty, sometimes apodictic — in the presence of infinity? The answer can by no means be found in external reality, quite the contrary: it seems that the very purpose of semantics is to make this question untractable with the help of an ad hoc analytical newspeak in which one cannot even formulate the above question. Transcendental syntax comes from the constatation that logic is better off when there is no… Expand

No Paper Link Available

#### References

SHOWING 1-10 OF 19 REFERENCES

A New Constructive Logic: Classical Logic

- Computer Science
- Math. Struct. Comput. Sci.
- 1991

This work follows the order of discovery of the concepts, which (as expected) starts with the semantics and ends with the syntex; it is hoped that this orthogonal look at the same object will help to apprehend the concepts. Expand

The Blind Spot: Lectures on Logic

- Mathematics
- 2011

These lectures on logic, more specifically proof theory, are basically intended for postgraduate students and researchers in logic.
The question at stake is the nature of mathematical knowledge and… Expand

Geometry of interaction III: accommodating the additives

- Mathematics
- 1995

The paper expounds geometry of interaction, for the first time in the full case, i.e. for all connectives of linear logic, including additives and constants. The interpretation is done within a… Expand

Geometry of Interaction V: Logic in the hyperfinite factor

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2011

Geometry of Interaction is a transcendental syntax developed in the framework of operator algebras that provides a built-in interpretation of cut-elimination as well as an explanation for light, i.e., complexity sensitive, logics. Expand

Intuitionistic type theory

- Computer Science
- Studies in proof theory
- 1984

These lectures were given in Padova and Munich later in the same year as part of the meeting on Konstruktive Mengenlehre und Typentheorie which was organized in Munich by Prof. Helmut Schwichtenberg. Expand

Geometry of Interaction 1: Interpretation of System F

- Computer Science
- 1989

The chapter describes the development of a semantics of computation free from the twin drawbacks of reductionism and subjectivism and that a representative class of algorithms can be modelized by means of standard mathematics. Expand

The structure of multiplicatives

- Mathematics, Computer Science
- Arch. Math. Log.
- 1989

Investigating Girard's new propositionnal calculus which aims at a large scale study of computation, we stumble quickly on that question: What is a multiplicative connective? We give here a detailed… Expand

Three-valued logic and cut-elimination: The actual meaning of Takeuti's conjecture

- Mathematics
- 1976

CONTENTSIntroduction............................................................................................................ 5A. The three-valued predicate… Expand

Locus Solum

- Mathematical Structures in Computer Science, 11:301 – 506
- 2001