-
54A Square of Oppositions in Intuitionistic Logic with Strong NegationLogica Universalis 10 (2-3): 327-338. 2016.In this paper, we introduce a Hilbert style axiomatic calculus for intutionistic logic with strong negation. This calculus is a preservative extension of intuitionistic logic, but it can express that some falsity are constructive. We show that the introduction of strong negation allows us to define a square of opposition based on quantification on possible worlds.
-
9Completeness and representation theorem for epistemic states in first-order predicate calculusLogica Trianguli 3 85-109. 1999.The aim of this paper is to present a strongly complete first order functional predicate calculus generalized to models containing not only ordinary classical total functions but also arbitrary partial functions. The completeness proof follows Henkin’s approach, but instead of using maximally consistent sets, we define saturated deductively closed consistent sets . This provides not only a completeness theorem but a representation theorem: any SDCCS defines a canonical model which determine a un…Read more
-
117Partial monotonic prototheticsStudia Logica 66 (1): 147-163. 2000.This paper has four parts. In the first part, I present Leniewski's protothetics and the complete system provided for that logic by Henkin. The second part presents a generalized notion of partial functions in propositional type theory. In the third part, these partial functions are used to define partial interpretations for protothetics. Finally, I present in the fourth part a complete system for partial protothetics. Completeness is proved by Henkin's method [4] using saturated sets instead of…Read more
-
63La notion de proposition dans les Principles de Russell: un exemple de conception réaliste du langageDialogue 18 (4): 538-555. 1979.
-
Eléments de logique contemporaineRevue Philosophique de la France Et de l'Etranger 182 (3): 354-355. 1992.
-
An algebra for finitary ontology or a functionally complete language for the finitary theory of typesLogica Trianguli 4 41-51. 2000.This paper presents a generalization of a proposal of van Benthem’s who has shown how to provide a canonical name for any object in propositional type theory. Van Benthem’s idea is to characterize any function in the hierarchy by the Boolean values the function takes for any sequence of arguments. The recursive definition of canonical names uses only the abstraction, functional application, the identity operator and the fact that we have a name for the true and the false. We show that this resul…Read more
-
94Qu'est-ce qu'un acte jugé faisable ?Philosophiques 28 (2): 369-380. 2001.Parmi l'ensemble de toutes les propositions à propos desquelles un agent rationnel entretient des croyances et des désirs, certaines correspondent à des actes que l'agent juge faisables. Le but de mon intervention est de caractériser ce sous-ensemble de propositions en termes de leur probabilité et de leur désirabilité.Among the set of all propositions on which a rational agent entertains beliefs and desires, some express acts considered as possible options for the agent. The aim of this paper i…Read more
Montréal, Quebec, Canada
Areas of Specialization
| Epistemology |
| Logic and Philosophy of Logic |
Areas of Interest
| Logic and Philosophy of Logic |
| 20th Century Philosophy |