Topic
Logical assertion
About: Logical assertion is a research topic. Over the lifetime, 10 publications have been published within this topic receiving 76 citations. The topic is also known as: assertion.
Papers
TL;DR: In this paper, the fundamental theorem of probability is reformulated in the finite case as a computable linear programming problem, and its implications for the subjective theory of statistical inference are discussed. But this paper is restricted to the case of conditional predictions.
Abstract: We study de Finetti's "fundamental theorem of probability", reformulated in the finite case as a computable linear programming problem. The theorem is substantially extended, and shown to have important implications for the subjective theory of statistical inference. It supports an operational meaning for the partial assertion of prevision via asserted bounds. We extend the theorem to apply to quantities more general than events, to allow bounds and orderings on previsions as the input to the programming problem, and even to allow bounds on conditional previsions as the input and output. In a philosophical discussion, prevision is explicitly recognized as a completion of the notion of logical assertion, introduced by Frege. Partial prevision assertions then allow the representation of weaker forms of uncertain knowledge, spanning a range of possible numerical values for a quantity between the assertion of a precise prevision value and the mere unassertive contemplation of the quantity.
40 citations
TL;DR: It is asserted that causal links and links of information outside the light cone do not exist, rather than that such links are more difficult to describe mathematically than links on or within the light cones.
Abstract: THE fundamental postulate of the special theory of relativity, and a vital principle of the general theory of relativity, is that there exists a maximum speed of propagation, confining the link between cause and effect to the surface or interior of the light cone. It is important to realize that, particularly in the special theory, this postulate is used essentially not in the mathematical but in the logical sense. That is to say, it is asserted that causal links and links of information outside the light cone do not exist, rather than that such links are more difficult to describe mathematically than links on or within the light cone. This logical assertion is used to the full in the denial of the possibility of clock synchronization.
14 citations
14 citations
PARC1
TL;DR: A method definition can be viewed as a logical assertion that if the operation is invoked on objects of the appropriate types then the method body will satisfy the specification of the operation.
Abstract: A method definition can be viewed as a logical assertion. Whenever we declare a method as the implementation of an operation, we assert that if the operation is invoked on objects of the appropriate types then the method body will satisfy the specification of the operation. This view of methods as assertions is simple but general. Among its applications are: methods defined on interfaces as well as on classes; an elementary type system for objects that handles multi-methods; and a mechanism for method dispatch based on the desired output type as well as on the types of arguments. Further, these applications are compatible with traditional execution models and implementation techniques. Logical reasoning about methods plays a role at compile time, then gets out of the way.
10 citations
TL;DR: This paper deals with the theoretical analysis of the notion of interval valued fuzzy sets (IVFS) applied to possibility measures and some basic mode operations involving conjunction and disjunction combinations are examined.
Abstract: This paper deals with the theoretical analysis of the notion of interval valued fuzzy sets (IVFS) applied to possibility measures. This permits to provide interval valued possibility measure (IVPM) and interval valued necessity measure (IVNM) as well as interval valued possibility distribution (IVPD). Particularly, two kinds of IVPM will be provided. The first one assumes a conjunctive normal form and a disjunctive normal form pertaining to a logical assertion. While the second one considers a logical AND and a logical OR as an essence to construct the underlying interval. The properties of both representations are investigated. Also, some basic mode operations involving conjunction and disjunction combinations are examined. Conditioning in the setting of IVPM is introduced considering either a canonical extension of well established rules, or more interestingly by solving the underlying Cox's axiomatic equation. Finally, some further extensions using general class of t‐norms operators are discussed.
2 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2003 | 2 |
| 2000 | 1 |
| 1997 | 1 |
| 1994 | 1 |
| 1993 | 1 |
| 1991 | 1 |