One of the main applications of the logic of theory change is to the epistemic analysis of conditionals via the so-called Ramsey test. In the first part of the present note this test is studied in the limiting case where the theory being revised is inconsistent, and it is shown that this case manifests an intrinsic incompatibility between the Ramsey test and the AGM postulate of success. The paper then analyses the use of the postulate of success, and a weakening (...) of it, generating axioms of conditional logic via the test, and it is shown that for certain purposes both success and weak success are quite superfluous. This suggests the proposal of abandoning both success and weak success entirely, thus permitting retention of the postulate of preservation discarded by Gärdenfors. (shrink)
We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey–Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of non-monotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).Expectation is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)
How to accept a conditional? F. P. Ramsey proposed the following test in (Ramsey 1990).(RT) If A, then B must be accepted with respect to the current epistemic state iff the minimal hypothetical change of it needed to accept A also requires accepting B.
The paper studies first order extensions of classical systems of modal logic (see (Chellas, 1980, part III)). We focus on the role of the Barcan formulas. It is shown that these formulas correspond to fundamental properties of neighborhood frames. The results have interesting applications in epistemic logic. In particular we suggest that the proposed models can be used in order to study monadic operators of probability (Kyburg, 1990) and likelihood (Halpern-Rabin, 1987).
The article focuses on representing different forms of non-adjunctive inference as sub-Kripkean systems of classical modal logic, where the inference from □A and □B to □A∧B fails. In particular we prove a completeness result showing that the modal system that Schotch and Jennings derive from a form of non-adjunctive inference in (Schotch and Jennings, 1980) is a classical system strictly stronger than EMN and weaker than K (following the notation for classical modalities presented in Chellas, 1980). The unified semantical characterization (...) in terms of neighborhoods permits comparisons between different forms of non-adjunctive inference. For example, we show that the non-adjunctive logic proposed in (Schotch and Jennings, 1980) is not adequate in general for representing the logic of high probability operators. An alternative interpretation of the forcing relation of Schotch and Jennings is derived from the proposed unified semantics and utilized in order to propose a more fine-grained measure of epistemic coherence than the one presented in (Schotch and Jennings, 1980). Finally we propose a syntactic translation of the purely implicative part of Jaśkowski's system D2 into a classical system preserving all the theorems (and non-theorems) explicilty mentioned in (Jaśkowski, 1969). The translation method can be used in order to develop epistemic semantics for a larger class of non-adjunctive (discursive) logics than the ones historically investigated by Jaśkowski. (shrink)
An important trend in contemporary epistemology centers on elaborating an old idea of pragmatist pedigree: theory selection (and in general the process of changing view and fixing beliefs) presupposes epistemic values. This article focuses on analyzing the case where epistemic values are indeterminate or when the sources of valuation are multiple (epistemic values like coherence and simplicity need not order options in compatible ways). According to the theory that thus arises epistemic alternatives need not be fully ordered by an underlying (...) notion of information-value and therefore the usual economic techniques of optimization cannot be applied in order to compute optimal contractions. But in cases of this sort it is still rational to maximize, i.e. to deem an option as choosable when it is not known to be worse that any other. We present here basic results about a notion of liberal contraction based on maximizing quasi-orderings. This requires the previous solution of some open problems in the theory of rational choice functions, namely a full characterization of choice functions rationalizable in terms of maximization of quasi-transitive relations. We conclude by discussing the problem of what is the adequate feasible set for calculating maximizing solutions for contraction problems and by considering the epistemological roots of some counterexamples against the most fundamental axioms on choice functions (like α). While the first part of the paper shows how economic insights can be used to improve our understanding of the principles of belief formation and change, this final section reverses this strategy by showing the utility of epistemological insights and techniques for providing invariance conditions capable of regulating the applicability of the pure principles of choice. (shrink)
S. Jakowski introduced the discussive prepositional calculus D 2as a basis for a logic which could be used as underlying logic of inconsistent but nontrivial theories (see, for example, N. C. A. da Costa and L. Dubikajtis, On Jakowski's discussive logic, in Non-Classical Logic, Model Theory and Computability, A. I. Arruda, N. C. A da Costa and R. Chuaqui edts., North-Holland, Amsterdam, 1977, 37–56). D 2has afterwards been extended to a first-order predicate calculus and to a higher-order logic (cf. the (...) quoted paper). In this paper we present a natural version of D 2, in the sense of Jakowski and Gentzen; as a consequence, we suggest a new formulation of the discussive predicate calculus (with equality). A semantics for the new calculus is also presented. (shrink)
In view of the presertt state of development of non cktssicallogic, especially of paraconsistent logic, a new stand regardmg the relatzons between logtc and ontology is deferded In a parody of a dicturn of Quine, my stand may be summarized as follows To be is to be the value of a vanable a specific language with a given underlymg logic Yet my stand differs from Qutne's, because, among other reasons, I accept some first order heterodox logIcs as genutne alternatwes to (...) ciassical logic I aiso discuss some questions of non classical logic to substantzate my argument, and suggest that rny position complements and extends some uleas advanced by L Apostei. (shrink)
Let L be a language containing the modal operator B - for full belief. An information model is a set E of stable L-theories. A sentence is valid if it is accepted in all theories of every model.
Daniel Ellsberg presented in Ellsberg (The Quarterly Journal of Economics 75:643–669, 1961) various examples questioning the thesis that decision making under uncertainty can be reduced to decision making under risk. These examples constitute one of the main challenges to the received view on the foundations of decision theory offered by Leonard Savage in Savage (1972). Craig Fox and Amos Tversky have, nevertheless, offered an indirect defense of Savage. They provided in Fox and Tversky (1995) an explanation of Ellsberg’s two-color problem (...) in terms of a psychological effect: ambiguity aversion . The ‘comparative ignorance’ hypothesis articulates how this effect works and explains why it is important to an understanding of the typical pattern of responses associated with Ellsberg’s two-color problem. In the first part of this article we challenge Fox and Tversky’s explanation. We present first an experiment that extends Ellsberg’s two-color problem where certain predictions of the comparative ignorance hypothesis are not confirmed. In addition the hypothesis seems unable to explain how the subjects resolve trade-offs between security and expected pay-off when vagueness is present. Ellsberg offered an explanation of the typical behavior elicited by his examples in terms of these trade-offs and in section three we offer a model of Ellsberg’s trade-offs. The model takes seriously the role of imprecise probabilities in explaining Ellsberg’s phenomenon. The so-called three-color problem was also considered in Fox and Tversky (1995). We argue that Fox and Tversky’s analysis of this case breaks a symmetry with their analysis of the two-color problem. We propose a unified treatment of both problems and we present a experiment that confirms our hypothesis. (shrink)
This article elaborates on foundational issues in the social sciences and their impact on the contemporary theory of belief revision. Recent work in the foundations of economics has focused on the role external social norms play in choice. Amartya Sen has argued in [Sen93] that the traditional rationalizability approach used in the theory of rational choice has serious problems accommodating the role of social norms. Sen’s more recent work [Sen96, Sen97] proposes how one might represent social norms in the theory (...) of choice, and in a very recent article [BS07] Walter Bossert and Kotaro Suzumura develop Sen’s proposal, offering an extension of the classical theory of choice that is capable of dealing with social norms. The first part of this article offers an alternative functional characterization of the extended notion of rationality employed by Bossert and Suzumura in [BS07]. This characterization, unlike the one offered in [BS07], represents a norm-sensitive notion of rationality in terms of a pure functional constraint unmediated by a notion of revealed preference (something that is crucial for the application developed in the second part of this article). This functional characterization is formulated for general domains (as is Bossert and Suzumura’s characterization) and is therefore empirically more applicable than usual characterizations of rationality. Interestingly, the functional constraint we propose is a variant of a condition first entertained in [AGM85] by Carlos Alchourr´on, Peter Gärdenfors and David Makinson in the area of belief change. (shrink)
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (like (...) FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)
This paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic.
This article elaborates on foundational issues in the social sciences and their impact on the contemporary theory of belief revision. Recent work in the foundations of economics has focused on the role external social norms play in choice. Amartya Sen has argued in [Sen93] that the traditional rationalizability approach used in the theory of rational choice has serious problems accommodating the role of social norms. Sen's more recent work [Sen96, Sen97] proposes how one might represent social norms in the theory (...) of choice, and in a very recent article [BS07] Walter Bossert and Kotaro Suzumura develop Sen's proposal, offering an extension of the classical theory of choice that is capable of dealing with social norms.The first part of this article offers an alternative functional characterization of the extended notion of rationality employed by Bossert and Suzumura in [BS07]. This characterization, unlike the one offered in [BS07], represents a norm-sensitive notion of rationality in terms of a pure functional constraint unmediated by a notion of revealed preference (something that is crucial for the application developed in the second part of this article). This functional characterization is formulated for general domains (as is Bossert and Suzumura's characterization) and is therefore empirically more applicable than usual characterizations of rationality. Interestingly, the functional constraint we propose is a variant of a condition first entertained in [AGM85] by Carlos Alchourrón, Peter Gärdenfors and David Makinson in the area of belief change.The second part of this article applies the theory developed in the first part to the realm of belief change. We first point out that social norms can be invoked to concoct counterexamples against some postulates of belief change (like postulate (*7)) that are necessary for belief change to be relational. These examples constitute the epistemological counterpart of Sen's counterexamples against condition α in rational choice (as a matter of fact, Rott has showed in [Rot01] that condition and postulate (*7) are mutually mappable). These examples are variants of examples Rott has recently presented in [Rot04]. One of our main goals in this article consists in applying the theory developed in the first part to develop a theory of norm-inclusive belief change that circumvents the counterexamples. We offer a new axiomatization for belief change and we furnish correspondence results relating constraints of rational choice to postulates of belief change. (shrink)
In (Hertwig et al. , 2003) Hertwig et al. draw a distinction between decisions from experience and decisions from description. In a decision from experience an agent does not have a summary description of the possible outcomes or their likelihoods. A career choice, deciding whether to back up a computer hard drive, cross a busy street, etc., are typical examples of decisions from experience. In such decisions agents can rely only of their encounters with the corresponding prospects. By contrast, an (...) agent furnished with information sources such as drug-package inserts or mutual-fund brochures—all of which describe risky prospects—will often make decisions from description. In (Hertwig et al. , 2003) it is shown (empirically) that decisions from experience and decisions from description can lead to dramatically different choice behavior. Most of these results (summarized and analyzed in (Hertwig, 2009)) are concerned with the role of risk in decision making. This article presents some preliminary results concerning the role of uncertainty in decision-making. We focus on Ellsberg’s two-color problem and consider a chance setup based on double sampling. We report empirical results which indicate that decisions from description where subjects select between a clear urn, the chance setup based on double sampling and Ellsberg’s vague urn, are such that subjects perceive the chance setup at least as an intermediate option between clear and vague choices (and there is evidence indicating that the double sampling chance setup is seen as operationally indistinguishable from the vague urn). We then suggest how the iterated chance setup can be used in order to study decisions from experience in the case of uncertainty. (shrink)
The "Ellsberg phenomenon" has played a significant role in research on imprecise probabilities. Fox and Tversky [5] have attempted to explain this phenomenon in terms of their "comparative ignorance" hypothesis. We challenge that explanation and present empirical work suggesting an explanation that is much closer to Ellsberg's own diagnosis.
The notion of probability occupies a central role in contemporary epistemology and cognitive science. Nevertheless, the classical notion of probability is hard to reconcile with the central notions postulated by the epistemological tradition.
It is now well known that, on pain of triviality, the probability of a conditional cannot be identified with the corresponding conditional probability [27]. This surprising impossibility result has a qualitative counterpart. In fact, Peter Gardenfors showed in [13] that believing 'If A then B' cannot be equated with the act of believing B on the supposition that A.
Building on work that we reported at ISIPTA 2005 we revisit claims made by Fox and Tversky concerning their "comparative ignorance" hypothesis for decision making under uncertainty.
The paper provides a framework for representing belief-contravening hypotheses in games of perfect information. The resulting t-extended information structures are used to encode the notion that a player has the disposition to behave rationally at a node. We show that there are models where the condition of all players possessing this disposition at all nodes (under their control) is both a necessary and a sufficient for them to play the backward induction solution in centipede games. To obtain this result, we (...) do not need to assume that rationality is commonly known (as is done in [Aumann (1995)]) or commonly hypothesized by the players (as done in [Samet (1996)]). The proposed model is compared with the account of hypothetical knowledge presented by Samet in [Samet (1996)] and with other possible strategies for extending information structures with conditional propositions. (shrink)
We present a decision-theoretically motivated notion of contraction which, we claim, encodes the principles of minimal change and entrenchment. Contraction is seen as an operation whose goal is to minimize loses of informational value. The operation is also compatible with the principle that in contracting A one should preserve the sentences better entrenched than A (when the belief set contains A). Even when the principle of minimal change and the latter motivation for entrenchment figure prominently among the basic intuitions in (...) the works of, among others, Quine and Ullian (1978), Levi (1980, 1991), Harman (1988) and Gärdenfors (1988), formal accounts of belief change (AGM, KM – see Gärdenfors (1988); Katsuno and Mendelzon (1991)) have abandoned both principles (see Rott (2000)). We argue for the principles and we show how to construct a contraction operation, which obeys both. An axiom system is proposed. We also prove that the decision-theoretic notion of contraction can be completely characterized in terms of the given axioms. Proving this type of completeness result is a well-known open problem in the field, whose solution requires employing both decision-theoretical techniques and logical methods recently used in belief change. (shrink)
One of the reasons for adopting hyperbolic discounting is to explain preference reversals. Another is that this value structure suggests an elegant theory of the will. I examine the capacity of the theory to solve Newcomb's problem. In addition, I compare Ainslie's account with other procedural theories of choice that seem at least equally capable of accommodating reversals of preference.
In a series of recent articles Angelika Kratzer has argued that the standard account of modality along Kripkean lines is inadequate in order to represent context-dependent modals. In particular she argues that the standard account is unable to deliver a non-trivial account of modality capable of overcoming inconsistencies of the underlying conversational background.
Following the pioneer work of Bruno De Finetti [12], conditional probability spaces (allowing for conditioning with events of measure zero) have been studied since (at least) the 1950's. Perhaps the most salient axiomatizations are Karl Popper's in [31], and Alfred Renyi's in [33]. Nonstandard probability spaces [34] are a well know alternative to this approach. Vann McGee proposed in [30] a result relating both approaches by showing that the standard values of infinitesimal probability functions are representable as Popper functions, and (...) that every Popper function is representable in terms of the standard real values of some infinitesimal measure.Our main goal in this article is to study the constraints on (qualitative and probabilistic) change imposed by an extended version of McGee's result. We focus on an extension capable of allowing for iterated changes of view. Such extension, we argue, seems to be needed in almost all considered applications. Since most of the available axiomatizations stipulate (definitionally) important constraints on iterated change, we propose a non-question-begging framework, Iterative Probability Systems (IPS) and we show that every Popper function can be regarded as a Bayesian IPS. A generalized version of McGee's result is then proved and several of its consequences considered. In particular we note that our proof requires the imposition of Cumulativity, i.e. the principle that a proposition that is accepted at any stage of an iterative process of acceptance will continue to be accepted at any later stage. The plausibility and range of applicability of Cumulativity is then studied. In particular we appeal to a method for defining belief from conditional probability (first proposed in [42] and then slightly modified in [6] and [3]) in order to characterize the notion of qualitative change induced by Cumulative models of probability kinematics. The resulting cumulative notion is then compared with existing axiomatizations of belief change and probabilistic supposition. We also consider applications in the probabilistic accounts of conditionals [1] and [30]. (shrink)
It is now well known that, on pain of triviality, the probability of a conditional cannot be identified with the corresponding conditional probability [25]. This surprising impossibility result has a qualitative counterpart. In fact, Peter Gärdenfors showed in [13] that believing ‘If A then B’ cannot be equated with the act of believing B on the supposition that A — as long as supposing obeys minimal Bayesian constraints.Recent work has shown that in spite of these negative results, the question ‘how (...) to accept a conditional?’ has a clear answer. Even if conditionals are not truth-carriers, they do have precise acceptability conditions. Nevertheless most epistemic models of conditionals do not provide acceptance conditions for iterated conditionals. One of the main goals of this essay is to provide a comprehensive account of the notion of epistemic conditionality covering all forms of iteration.First we propose an account of the basic idea of epistemic conditionality, by studying the conditionals validated by epistemic models where iteration is permitted but not constrained by special axioms. Our modeling does not presuppose that epistemic states should be represented by belief sets (we only assume that to each epistemic state corresponds an associated belief state). A full encoding of the basic epistemic conditionals (encompassing all forms of iteration) is presented and a representation result is proved.In the second part of the essay we argue that the notion of change involved in the evaluation of conditionals is suppositional, and that such notion should be distinguished from the notion of updating (modelled by AGM and other methods). We conclude by considering how some of the recent modellings of iterated change fare as methods for iterated supposing. (shrink)
Recent work has shown that in spite of these negative results, the question 'how to accept a conditional?' has a clear answer. Even if conditionals are not truth-carriers, they do have precise acceptability conditions. Nevertheless most epistemic models of conditionals do not provide acceptance conditions for iterated conditionals. One of the main goals of this essay is to provide a comprehensive account of the notion of epistemic conditionality covering all forms of iteration.
Following the pioneer work of Bruno De Finetti, conditional probability spaces (allowing for conditioning with events of measure zero) have been studied since (at least) the 1950's.
Normative accounts in terms of similarity can be deployed in order to provide semantics for systems of context-free default rules and other sophisticated conditionals. In contrast, procedural accounts of decision in terms of similarity (Rubinstein 1997) are hard to reconcile with the normative rules of rationality used in decision-making, even when suitably weakened.
The paper provides a framework for representing belief-contravening hypotheses in games of perfect information. The resulting t-extended information structures are used to encode the notion that a player has the disposition to behave rationally at a node. We show that there are models where the condition of all players possessing this disposition at all nodes (under their control) is both a necessary and a sufficient for them to play the backward induction solution in centipede games. To obtain this result, we (...) do not need to assume that rationality is commonly known (as is done in [Aumann (1995)]) or commonly hypothesized by the players (as done in [Samet (1996)]). The proposed model is compared with the account of hypothetical knowledge presented by Samet in [Samet (1996)] and with other possible strategies for extending information structures with conditional propositions. (shrink)
In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and conservative translations between them. In this paper we (...) present some conservative translations involving classical logic, Lukasiewicz three-valued system L 3, the intuitionistic system I 1 and several paraconsistent logics, as for instance Sette's system P 1, the D'Ottaviano and da Costa system J 3 and da Costa's systems C n, 1 n. (shrink)
In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and conservative translations between them. In this paper we (...) present some conservative translations involving classical logic, Lukasiewicz three-valued system L₃, the intuitionistic system Iⁱ and several para-consistent logics, as for instance Sette's system Pⁱ, the D'Ottaviano and da Costa system J₃ and da Costa's systems $\text{C}_{n}$ , 1 ≤ n ≤ ω. (shrink)
Renaud Barbaras, La vie lacunaire [Thomas Vercruysse, p. 324] • Wolfram Hogrebe, Der implizite Mensch [Federica Ceranovi, p. 334] • Emmanuel Alloa, Das durchscheinende Bild [Maria Teresa Costa, p. 344] • Alexander R. Galloway, The Interface Effect [Angela Maiello, p. 346] • Francisco José Ramos, La significación del lenguaje poético [Michele Gardini, p. 348] • Alessandro Arbo, Entendre comme. Wittgenstein et l’esthétique musicale [Leonardo V. Distaso, p. 351.
No Órganon Aristóteles descreve alguns esquemas dedutivos nos quais a presença de inconsistências não acarreta a trivialização da teoria lógica envolvida. Esta tese é corroborada por três diferentes situações teóricas estudadas por ele, as quais são apresentadas neste trabalho. Analizamos o esquema de inferência utilizado por Aristóteles no Protrepticus e o método de demonstração indireta para os silogismos categóricos. Ambos os métodos exemplificam como Aristóteles emprega estratégias de redução ao absurdo logicamente clássicas. Na sequência, discutimos os silogismos válidos a partir (...) de premissas opostas (contrárias e contraditórias) estudadas pelo Estagirita no Analytica Priora (B15). De acordo com o autor, os seguintes silogismos são válidos a partir de premissas opostas, nos quais letras latinas minúsculas denotam termos como sujeito e predicado, enquanto que letras latinas maiúsculas denotam proposições categóricas tal como na notação tradicional: (i) na segunda figura, Eba,Aba ` Eaa (Cesare), Aba, Eba ` Eaa (Camestres), Eba, I ba ` Oaa (Festino), e Aba,Oba ` Oaa (Baroco); (ii) na terceira, Eab,Aab ` Oaa (Felapton), Oab,Aab ` Oaa (Bocardo) e Eab, Iab ` Oaa (Ferison). Por fim, discutimos a passagem do Analytica Posteriora (A11) no qual Aristóteles enuncia que o Princípio de Não-Contradição não é, em geral, pressuposto de toda demonstração (silogismo científico), mas apenas daquelas nas quais a conclusão deve ser provada a partir do Princípio; o Estagirita enuncia que se um silogismo da primeira figura tiver o termo maior consistente, os outros termos da demonstração podem ser separadamente inconsistentes. Estes resultados permitem-nos propor uma interpretação de sua teoria dedutiva como uma teoria paraconsistente lato sensu. Primeiramente, efetuamos uma análise hermenêutica, avaliando seu significado lógico e a correlação desses resultados com outros aspectos da filosofia de Aristóteles. Em segundo lugar, consignamos uma interpretação dos silogismos aristotélicos a partir de premissas opostas à luz dos antilogismos propostos por Christine Ladd-Franklin em 1883, e da demonstração aristotélica com termos inconsistentes nas lógicas paraconsistentes Cn, 1 n !, introduzidas por da Costa em 1963. Esses dois aspectos não parecem ter sido ainda detalhadamente analisados na literatura. DOI:10.5007/1808-1711.2010v14n1p71. (shrink)
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)
