The logic of justified belief,explicit knowledge,and conclusive evidence

We present a complete, decidable logic for reasoning about a notion of completely trustworthy (“conclusive”) evidence and its relations to justifiable (implicit) belief and knowledge, as well as to their explicit justifications. This logic makes use of a number of evidence-related notions such as availability, admissibility, and “goodness” of a piece of evidence, and is based on an innovative modification of the Fitting semantics for Artemov?s Justification Logic designed to preempt Gettier-type counterexamples. We combine this with ideas from belief revision and awareness logics to provide an account for explicitly justified (defeasible) knowledge based on conclusive evidence that addresses the problem of (logical) omniscience.     

A process for generating quantitative belief functions

We present a structured methodology for transforming qualitative preference relationships among propositions into appropriate numeric representations. This approach will be useful in the difficult process of knowledge acquisition from experts on the degree of belief in various propositions or the probability of the truthfulness of those propositions. The approach implicitly (through the qualitative assignments) and explicitly (through the vague interval pairwise comparisons) provides for different levels of preference relationships. Among its advantages, it permits the expert to: explore the given problem situation, using linguistic quantifiers; avoid the premature use of numeric measures; and identify input data that are inconsistent with the theory of belief functions.     

Sets versus trial sequences,Hausdorff versus von Mises: “Pure” mathematics prevails in the foundations of probability around 1920

The paper discusses the tension which occurred between the notions of set (with measure) and (trial-) sequence (or—to a certain degree—between nondenumerable and denumerable sets) when used in the foundations of probability theory around 1920. The main mathematical point was the logical need for measures in order to describe general nondiscrete distributions, which had been tentatively introduced before (1919) based on von Mises’s notion of the “Kollektiv.” In the background there was a tension between the standpoints of pure mathematics and “real world probability” (in the words of J.L. Doob) at the time. The discussion and publication in English translation (in Appendix) of two critical letters of November 1919 by the “pure” mathematician Felix Hausdorff to the engineer and applied mathematician Richard von Mises compose about one third of the paper. The article also investigates von Mises’s ill-conceived effort to adopt measures and his misinterpretation of an influential book of Constantin Carathéodory. A short and sketchy look at the subsequent development of the standpoints of the pure and the applied mathematician—here represented by Hausdorff and von Mises—in the probability theory of the 1920s and 1930s concludes the paper.     

Interpretation of De Finetti coherence criterion in ?ukasiewicz Logic

De Finetti gave a natural definition of “coherent probability assessment” β:E→[0,1] of a set E={X₁,…,X_m} of “events” occurring in an arbitrary set W⊆[0,1]^E of “possible worlds”. In the particular case of yes-no events, (where W⊆{0,1}^E), Kolmogorov axioms can be derived from his criterion. While De Finetti’s approach to probability was logic-free, we construct a theory Θ in infinite-valued ?ukasiewicz propositional logic, and show: (i) a possible world of W is a valuation satisfying Θ, (ii) β is coherent iff it is a convex combination of valuations satisfying Θ, (iii) iff β agrees on E with a state of the Lindenbaum MV-algebra of Θ, (iv) iff for some Borel probability measure μ on W. Thus ?ukasiewicz semantics, MV-algebraic (finitely additive) states, and (countably additive) Borel probability measures provide a universal representation of coherent assessments of events occurring in any conceivable set of possible worlds.     

Propagating belief functions in qualitative Markov trees

This article is concerned with the computational aspects of combining evidence within the theory of belief functions. It shows that by taking advantage of logical or categorical relations among the questions we consider, we can sometimes avoid the computational complexity associated with brute-force application of Dempster's rule.The mathematical setting for this article is the lattice of partitions of a fixed overall frame of discernment. Different questions are represented by different partitions of this frame, and the categorical relations among these questions are represented by relations of qualitative conditional independence or dependence among the partitions. Qualitative conditional independence is a categorical rather than a probabilistic concept, but it is analogous to conditional independence for random variables.We show that efficient implementation of Dempster's rule is possible if the questions or partitions for which we have evidence are arranged in a qualitative Markov tree—a tree in which separations indicate relations of qualitative conditional independence. In this case, Dempster's rule can be implemented by propagating belief functions through the tree.     

A constructive investigation of satisfiability

We present a constructive analysis of the logical notions of satisfiability and consistency for first-order intuitionistic formulae. In particular, we use formal topology theory to provide a positive semantics for satisfiability. Then we propose a “co-inductive” logical calculus, which captures the positive content of consistency.     

How ordinary elimination became Gaussian elimination

Newton, in notes that he would rather not have seen published, described a process for solving simultaneous equations that later authors applied specifically to linear equations. This method — which Euler did not recommend, which Legendre called “ordinary,” and which Gauss called “common” — is now named after Gauss: “Gaussian” elimination. Gauss’s name became associated with elimination through the adoption, by professional computers, of a specialized notation that Gauss devised for his own least-squares calculations. The notation allowed elimination to be viewed as a sequence of arithmetic operations that were repeatedly optimized for hand computing and eventually were described by matrices.     

A new rating system for duplicate bridge

We propose a new way to rate individual duplicate bridge players, which we believe is superior to the masterpoint system currently used by the American Contract Bridge League. This method measures only a player’s current skill level, and not how long or how frequently he has played. It is based on simple ideas from the theory of statistics and from linear algebra, and should be easy to implement.One particular issue which can occur within any system proposing to rate individual players using results earned by partnerships is what we call the “nonuniqueness problem”. This refers to the occasional inability for data to distinguish who is the “good player” and who is the “bad player” within particular partnerships. We prove that under our system this problem disappears if either (a) a certain “partnership graph” has no bipartite components, or if (b) every player is required to participate in at least one individual game.Finally, we present some data from a bridge club in Reno, NV. They show that even if (a) and (b) do not hold, our system will provide (unique) ratings for most players.     

Robert Leslie Ellisʼs work on philosophy of science and the foundations of probability theory

The goal of this paper is to provide an extensive account of Robert Leslie Ellis?s largely forgotten work on philosophy of science and probability theory. On the one hand, it is suggested that both his ‘idealist’ renovation of the Baconian theory of induction and a ‘realism’ vis-à-vis natural kinds were the result of a complex dialogue with the work of William Whewell. On the other hand, it is shown to what extent the combining of these two positions contributed to Ellis?s reformulation of the metaphysical foundations of traditional probability theory. This parallel is assessed with reference to the disagreement between Ellis and Whewell on the nature of (pure) mathematics and its relation to scientific knowledge.     

Uniformly primary ideals

This article introduces and advances the basic theory of “uniformly primary ideals” for commutative rings, a concept that imposes a certain boundedness condition on the usual notion of “primary ideal”. Characterizations of uniformly primary ideals are provided along with examples that give the theory independent value. Applications are also provided in contexts that are relevant to Noetherian rings.     

Visualizations of the Square of Opposition

In logic, diagrams have been used for a very long time. Nevertheless philosophers and logicians are not quite clear about the logical status of diagrammatical representations. Fact is that there is a close relationship between particular visual (resp. graphical) properties of diagrams and logical properties. This is why the representation of the four categorical propositions by different diagram systems allows a deeper insight into the relations of the logical square. In this paper I want to give some examples. I would like to thank the two anonymous reviewers for helpful comments and criticisms.     

Almost disjoint large subsets of semigroups

There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick, central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial combinatorial structure. It is known that in (N,+) any central set may be partitioned into infinitely many pairwise disjoint central sets. We extend this result to a large class of semigroups (including (N,+)) by showing that if S is a semigroup in this class which has cardinality κ then any central set can be partitioned into κ many pairwise disjoint central sets. We also show that for this same class of semigroups, if there exists a collection of μ almost disjoint subsets of any member S, then any central subset of S contains a collection of μ almost disjoint central sets. The same statement applies if “central” is replaced by “thick”; and in the case that the semigroup is left cancellative, “central” may be replaced by “piecewise syndetic”. The situation with respect to syndetic sets is much more restrictive. For example, there does not exist an uncountable collection of almost disjoint syndetic subsets of N. We investigate the extent to which syndetic sets can be split into disjoint syndetic sets.     

Non-Classical Stems from Classical: N. A. Vasiliev’s Approach to Logic and his Reassessment of the Square of Opposition

In the XIXth century there was a persistent opposition to Aristotelian logic. Nicolai A. Vasiliev (1880–1940) noted this opposition and stressed that the way for the novel – non-Aristotelian – logic was already paved. He made an attempt to construct non-Aristotelian logic (1910) within, so to speak, the form (but not in the spirit) of the Aristotelian paradigm (mode of reasoning). What reasons forced him to reassess the status of particular propositions and to replace the square of opposition by the triangle of opposition? What arguments did Vasiliev use for the introduction of new classes of propositions and statement of existence of various levels in logic? What was the meaning and role of the “method of Lobachevsky” which was implemented in construction of imaginary logic? Why did psychologism in the case of Vasiliev happen to be an important factor in the composition of the new ‘imaginary’ logic, as he called it?      

Cosheaves and connectedness in formal topology

The localic definitions of cosheaves, connectedness and local connectedness are transferred from impredicative topos theory to predicative formal topology. A formal topology is locally connected (has base of connected opens) iff it has a cosheaf π₀ together with certain additional structure and properties that constrain π₀ to be the connected components cosheaf. In the inductively generated case, complete spreads (in the sense of Bunge and Funk) corresponding to cosheaves are defined as formal topologies. Maps between the complete spreads are equivalent to homomorphisms between the cosheaves. A cosheaf is the connected components cosheaf for a locally connected formal topology iff its complete spread is a homeomorphism, and in this case it is a terminal cosheaf.A new, geometric proof is given of the topos-theoretic result that a cosheaf is a connected components cosheaf iff it is a “strongly terminal” point of the symmetric topos, in the sense that it is terminal amongst all the generalized points of the symmetric topos. It is conjectured that a study of sites as “formal toposes” would allow such geometric proofs to be incorporated into predicative mathematics.     

Lifting Lévy processes to hyperfinite random walks

An internal lifting for an arbitrary measurable Lévy process is constructed. This lifting reflects our intuitive notion of a process which is the infinitesimal sum of its infinitesimal increments, those in turn being independent from and closely related to each other - for short, the process can be regarded as some kind of random walk (where the step size generically will vary). The proof uses the existence of càdlàg modifications of Lévy processes and certain features of hyperfinite adapted probability spaces, commonly known as the “model theory of stochastic processes”.     

Polylogarithms,functional equations and more: The elusive essays of William Spence (1777–1815)

The little-known Scottish mathematician William Spence was an able analyst, one of the first in Britain to be conversant with recent continental advances, and having original views. His major work on “logarithmic transcendents” gives the first detailed account of polylogarithms and related functions. A theory of algebraic equations was published just after his early death; and further essays, edited by John Herschel, were published posthumously. The most substantial of these concern an extension of his work on “logarithmic transcendents”, and the general solution of linear differential and difference equations. But awareness of Spence?s works was long delayed by their supposed unavailability. Spence?s life, the story of his “lost” publications, and a summary of all his essays are here described.     

Combinatorial analysis of proofs in projective and affine geometry

The axioms of projective and affine plane geometry are turned into rules of proof by which formal derivations are constructed. The rules act only on atomic formulas. It is shown that proof search for the derivability of atomic cases from atomic assumptions by these rules terminates (i.e., solves the word problem). This decision method is based on the central result of the combinatorial analysis of derivations by the geometric rules: The geometric objects that occur in derivations by the rules can be restricted to those known from the assumptions and cases. This “subterm property” is proved by permuting suitably the order of application of the geometric rules. As an example of the decision method, it is shown that there cannot exist a derivation of Euclid’s fifth postulate if the rule that corresponds to the uniqueness of the parallel line construction is taken away from the system of plane affine geometry.     

Ploucquet’s “Refutation” of the Traditional Square of Opposition

In the 18th century, Gottfried Ploucquet developed a new syllogistic logic where the categorical forms are interpreted as set-theoretical identities, or diversities, between the full extension, or a non-empty part of the extension, of the subject and the predicate. With the help of two operators ‘O’ (for “Omne”) and ‘Q’ (for “Quoddam”), the UA and PA are represented as ‘O(S) – Q(P)’ and ‘Q(S) – Q(P)’, respectively, while UN and PN take the form ‘O(S) > O(P)’ and ‘Q(S) > O(P)’, where ‘>’ denotes set-theoretical disjointness. The use of the symmetric operators ‘–’ and ‘>’ gave rise to a new conception of conversion which in turn lead Ploucquet to consider also the unorthodox propositions O(S) – O(P), Q(S) – O(P), O(S) > Q(P), and Q(S) > Q(P). Although Ploucquet’s critique of the traditional theory of opposition turns out to be mistaken, his theory of the “Quantification of the Predicate” is basically sound and involves an interesting “Double Square of Opposition”. My thanks are due to Hanno von Wulfen for helpful discussions and for transforming the word-document into a Latex-file.     

Counting strings in Dyck paths

This paper deals with the enumeration of Dyck paths according to the statistic “number of occurrences of τ”, for an arbitrary string τ. In this direction, the statistic “number of occurrences of τ at height j” is considered. It is shown that the corresponding generating function can be evaluated with the aid of Chebyshev polynomials of the second kind. This is applied to every string of length 4. Further results are obtained for the statistic “number of occurrences of τ at even (or odd) height”.     

Lindelöf spaces which are Menger, Hurewicz, Alster, productive, or D

We discuss relationships in Lindelöf spaces among the properties “Menger”, “Hurewicz”, “Alster”, “productive”, and “D”.