Results 1 
6 of
6
Constructivism and Proof Theory
, 2003
"... Introduction to the constructive point of view in the foundations of mathematics, in
particular intuitionism due to L.E.J. Brouwer, constructive recursive mathematics
due to A.A. Markov, and Bishop’s constructive mathematics. The constructive interpretation
and formalization of logic is described. F ..."
Abstract

Cited by 162 (4 self)
 Add to MetaCart
Introduction to the constructive point of view in the foundations of mathematics, in
particular intuitionism due to L.E.J. Brouwer, constructive recursive mathematics
due to A.A. Markov, and Bishop’s constructive mathematics. The constructive interpretation
and formalization of logic is described. For constructive (intuitionistic)
arithmetic, Kleene’s realizability interpretation is given; this provides an example
of the possibility of a constructive mathematical practice which diverges from classical
mathematics. The crucial notion in intuitionistic analysis, choice sequence, is
briefly described and some principles which are valid for choice sequences are discussed.
The second half of the article deals with some aspects of proof theory, i.e.,
the study of formal proofs as combinatorial objects. Gentzen’s fundamental contributions
are outlined: his introduction of the socalled Gentzen systems which use
sequents instead of formulas and his result on firstorder arithmetic showing that
(suitably formalized) transfinite induction up to the ordinal "0 cannot be proved in
firstorder arithmetic.
Reasoning with Temporal Logic on Truncated Paths
"... We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path which is finite, but not necessarily maximal. Truncated paths arise naturally in several areas, among which are incomplete verification methods (such as simulation or bounded model checking ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path which is finite, but not necessarily maximal. Truncated paths arise naturally in several areas, among which are incomplete verification methods (such as simulation or bounded model checking) and hardware resets. We present a formalism for reasoning about truncated paths, and analyze its characteristics.
The combination of paradoxical, uncertain and imprecise sources of information based on DSmT and neutrofuzzy inference
 Journal of Applied Mathematics & Computing, Seoul, South Korea
, 2005
"... ..."
unknown title
, 2009
"... The significance of Nathanson’s boss factor in legitimising Aristotle’s particularisation Why we need to revise current interpretations of Cantor’s, Gödel’s, Turing’s and Tarski’s formal reasoning ..."
Abstract
 Add to MetaCart
The significance of Nathanson’s boss factor in legitimising Aristotle’s particularisation Why we need to revise current interpretations of Cantor’s, Gödel’s, Turing’s and Tarski’s formal reasoning
unknown title
, 2009
"... The significance of Nathanson’s boss factor in legitimising Aristotle’s particularisation Why we need to revise current interpretations of Cantor’s, Gödel’s, Turing’s and Tarski’s formal reasoning ..."
Abstract
 Add to MetaCart
The significance of Nathanson’s boss factor in legitimising Aristotle’s particularisation Why we need to revise current interpretations of Cantor’s, Gödel’s, Turing’s and Tarski’s formal reasoning
unknown title
, 2009
"... The significance of Nathanson’s boss factor in legitimising Aristotle’s particularisation Why we need to revise current interpretations of Cantor’s, Gödel’s, Turing’s and Tarski’s formal reasoning ..."
Abstract
 Add to MetaCart
The significance of Nathanson’s boss factor in legitimising Aristotle’s particularisation Why we need to revise current interpretations of Cantor’s, Gödel’s, Turing’s and Tarski’s formal reasoning