124 research outputs found
Ramsification and the Ramifications of Prior's Puzzle
Ramsification is a well-known method of defining theoretical terms that figures centrally in a wide range of debates in metaphysics. Prior's puzzle is the puzzle of why, given the assumption that that-clauses denote propositions, substitution of "the proposition that P" for "that P" within the complements of many propositional attitude verbs sometimes fails to preserve truth, and other times fails to preserve grammaticality. On the surface, Ramsification and Prior's puzzle appear to have little to do with each other. But Prior's puzzle is much more general than is ordinarily appreciated, and Ramsification requires a solution to the generalized form of Prior's puzzle. Without such a solution, a wide range of theories will either fail to imply their Ramsey sentences, or have Ramsey sentences that are ill-formed. As a consequence, definitions of theoretical terms given using the Ramsey sentence will be either incorrect or nonsensical. I present a partial solution to the puzzle that requires making use of a neo-Davidsonian language for scientific theorizing, but the would-be Ramsifier still faces serious challenges
An Algebraic Approach to Mso-Definability on Countable Linear Orderings
We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three logical applications. First, we establish the first known collapse result for the quantifier alternation of MSO logic over countable linear orderings. Second, we solve an open problem posed by Gurevich and Rabinovich, concerning the MSO-definability of sets of rational numbers using the reals in the background. Third, we establish the MSO-definability of the set of yields induced by an MSO-definable set of trees, confirming a conjecture posed by Bruyère, Carton, and Sénizergues
Criteria of Empirical Significance: Foundations, Relations, Applications
This dissertation consists of three parts. Part I is a defense of an artificial language methodology in philosophy and a historical and systematic defense of the logical empiricists' application of an artificial language methodology to scientific theories. These defenses provide a justification for the presumptions of a host of criteria of empirical significance, which I analyze, compare, and develop in part II. On the basis of this analysis, in part III I use a variety of criteria to evaluate the scientific status of intelligent design, and further discuss confirmation, reduction, and concept formation
Going higher in the First-order Quantifier Alternation Hierarchy on Words
We investigate the quantifier alternation hierarchy in first-order logic on
finite words. Levels in this hierarchy are defined by counting the number of
quantifier alternations in formulas. We prove that one can decide membership of
a regular language to the levels (boolean combination of
formulas having only 1 alternation) and (formulas having only 2
alternations beginning with an existential block). Our proof works by
considering a deeper problem, called separation, which, once solved for lower
levels, allows us to solve membership for higher levels
Criteria of Empirical Significance: Foundations, Relations, Applications
This dissertation consists of three parts. Part I is a defense of an artificial language methodology in philosophy and a historical and systematic defense of the logical empiricists' application of an artificial language methodology to scientific theories. These defenses provide a justification for the presumptions of a host of criteria of empirical significance, which I analyze, compare, and develop in part II. On the basis of this analysis, in part III I use a variety of criteria to evaluate the scientific status of intelligent design, and further discuss confirmation, reduction, and concept formation
- …