On 30 Jul 2012, at 15:34, Alberto G. Corona wrote:
"Computations are not proof. There are similarities, and there are a
lot of interesting relationships between the two concepts, but we
cannot use proof theory for computation theory"
What goes to Another intriging duality : The Curry-Howar
On 7/30/2012 9:34 AM, Alberto G. Corona wrote:
"Computations are not proof. There are similarities, and there are a
lot of interesting relationships between the two concepts, but we
cannot use proof theory for computation theory"
What goes to Another intriging duality : The Curry-Howard isomor
"Computations are not proof. There are similarities, and there are a lot of
interesting relationships between the two concepts, but we cannot use proof
theory for computation theory"
What goes to Another intriging duality : The Curry-Howard isomorphism
between computer programs and mathematical pr
Le 29-juil.-12, à 07:34, Stephen P. King a écrit :
Dear Bruno,
From http://www.andrew.cmu.edu/user/awodey/preprints/fold.pdf
First-Order Logical Duality
we read:
"In the propositional case, one passes from a propositional theory
to a Boolean algebra by
constructing the Lindenbaum-Tarsk
Dear Bruno,
From http://www.andrew.cmu.edu/user/awodey/preprints/fold.pdf
First-Order Logical Duality
we read:
"In the propositional case, one passes from a propositional theory to a
Boolean algebra by
constructing the Lindenbaum-Tarski algebra of the theory, a construction
which identifies pro
5 matches
Mail list logo
