Trois sortes de définitions sont présentées et discutées: les définitions nominales, les définitions contextuelles et les définitions amplificatrices. On insiste sur le fait que I’elimination des definitions n’est pas forcement un procede automatique en particulier dans le cas de la logique paraconsistante. Finalement on s’int’resse à la théorie des objets de Meinong et l’on montre comment elle peut êrre considéréecomme une théorie des descripteurs.Three kinds of definitions are presented and discussed: nominal definitions, contextual definitions, amplifying definitions. It is emphasized that (...) the elimination of definitions is not necessarily straightforward in particular in the case of paraconsistent logic. Finally we have a look at Meinong’s theory objects and we show how it can be considered as a theory of descriptors. (shrink)
We first state a few previously obtained results that lead to general undecidability and incompleteness theorems in axiomatized theories that range from the theory of finite sets to classical elementary analysis. Out of those results we prove several incompleteness theorems for axiomatic versions of the theory of noncooperative games with Nash equilibria; in particular, we show the existence of finite games whose equilibria cannot be proven to be computable.
We formulate Suppes predicates for various kinds of space-time: classical Euclidean, Minkowski's, and that of General Relativity. Starting with topological properties, these continua are mathematically constructed with the help of a basic algebra of events; this algebra constitutes a kind of mereology, in the sense of Lesniewski. There are several alternative, possible constructions, depending, for instance, on the use of the common field of reals or of a non-Archimedian field (with infinitesimals). Our approach was inspired by the work of (...) class='Hi'>Whitehead (1919), though our philosophical stance is completely different from his. The structures obtained are idealized constructs underlying extant, physical space-time. (shrink)
We expose the main ideas, concepts and results about Jakowski's discussive logic, and apply that logic to the concept of pragmatic truth and to the Dalla Chiara-di Francia view of the foundations of physics.
We present some recent technical results of us on the incompleteness of classical analysis and then discuss our work on the Arnol'd decision problems for the stability of fixed points of dynamical systems.
Schrödinger logics are logical systems in which the principle of identity is not true in general. The intuitive motivation for these logics is both Erwin Schrödinger's thesis (which has been advanced by other authors) that identity lacks sense for elementary particles of modern physics, and the way which physicists deal with this concept; normally, they understandidentity as meaningindistinguishability (agreemment with respect to attributes). Observing that these concepts are equivalent in classical logic and mathematics, which underly the usual physical theories, we (...) present a higher-order logical system in which these concepts are systematically separated. A classical semantics for the system is presented and some philosophical related questions are mentioned. One of the main characteristics of our system is that Leibniz' Principle of the Identity of Indiscernibles cannot be derived. This fact is in accordance with some authors who maintain that quantum mechanics violates this principle. Furthermore, our system may be viewed as a way of making sense some of Schrödinger's logical intuitions about the nature of elementary particles. (shrink)
We apply the recently elaborated notions of ‘pragmatic truth’ and ‘pragmatic probability’ to the problem of the construction of a logic of inductive inference. It is argued that the system outlined here is able to overcome many of the objections usually levelled against such attempts. We claim, furthermore, that our view captures the essentially cumulative nature of science and allows us to explain why it is indeed reasonable to accept and believe in the conclusions reached by inductive inference.
(or not oveA-complete.) . Let * be a unary operator defined on the set F of formulas of the language £ (ie, if A is a formula of £, then *A is also a ...
