A proof of Fermat’s last theorem is demonstrated. It is very brief, simple, elementary, and absolutely arithmetical. The necessary premises for the proof are only: the three definitive properties of the relation of equality (identity, symmetry, and transitivity), modus tollens, axiom of induction, the proof of Fermat’s last theorem in the case of.
In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. -/- This dissertation (...) focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)
Learner’s attitude towards modular distance learning catches uncertainties as a world crisis occurs up to this point. As self-learning modules (SLMs) become a supplemental means of learning in new normal education, this study investigated efficiency towards the learners’ attitude and performance. Specifically, the study described the learners’ profile and their attitude and performance towards SLMs. It also ascertained the relationship between the learner’s profile with their attitude and performance, as well as the relationship between attitude and performance relevant to SLMs. (...) A descriptive-correlational research design was employed in the study with 88 non-randomly chosen participants from secondary schools in West Philippines. The learners’ GWA (general weighted average) was used to determine their performance and a survey questionnaire for their profile and attitude. Frequency counts, percentage, and Spearman’s rank correlation coefficient were used to analyze the data gathered with the aid of Jamovi software. Results revealed a strong correlation between attitude and performance, but there was no link between learner’s attitude and performance as to the learner’s profile. It was affirmed that attitude is a compelling factor that is related with performance. Hence, this research has broader ramifications that can direct the Bureau of Learning Delivery to orient the module writers to further contextualize the learning materials that can compound learner’s disposition and academic performance. (shrink)
Empirically-informed approaches to emotion often construe our emotions as modules: systems hardwired into our brains by evolution and purpose-built to generate certain coordinated patterns of expressive, physiological, behavioural and phenomenological responses. In ‘Against Modularity’ (2008), de Sousa argues that we shouldn’t think of our emotions in terms of a limited number of modules because this conflicts with our aspirations for a life of greater emotional richness. My aim in this paper is to defend de Sousa’s critique of modular emotion (...) taxonomies from some obvious rejoinders, and to develop his positive proposal as to how we might reconcile the evidence for emotional modularity with an attitude of disapproval towards rigid emotion taxonomies. (shrink)
According to the `grammatical account', scalar implicatures are triggered by a covert exhaustification operator present in logical form. This account covers considerable empirical ground, but there is a peculiar pattern that resists treatment given its usual implementation. The pattern centers on odd assertions like #"Most lions are mammals" and #"Some Italians come from a beautiful country", which seem to trigger implicatures in contexts where the enriched readings conflict with information in the common ground. Magri (2009, 2011) argues that, to account (...) for these cases, the basic grammatical approach has to be supplemented with the stipulations that exhaustification is obligatory and is based on formal computations which are blind to information in the common ground. In this paper, I argue that accounts of oddness should allow for the possibility of felicitous assertions that call for revision of the common ground, including explicit assertions of unusual beliefs such as "Most but not all lions are mammals" and "Some but not all Italians come from Italy". To adequately cover these and similar cases, I propose that Magri's version of the Grammatical account should be refined with the novel hypothesis that exhaustification triggers a bifurcation between presupposed (the negated relevant alternatives) and at-issue (the prejacent) content. The explanation of the full oddness pattern, including cases of felicitous proposals to revise the common ground, follows from the interaction between presupposed and at-issue content with an independently motivated constraint on accommodation. Finally, I argue that treating the exhaustification operator as a presupposition trigger helps solve various independent puzzles faced by extant grammatical accounts, and motivates a substantial revision of standard accounts of the overt exhaustifier "only". (shrink)
There is a growing consensus that emotions contribute positively to human practical rationality. While arguments that defend this position often appeal to the modularity of emotion-generation mechanisms, these arguments are also susceptible to the criticism, e.g. by Jones (2006), that emotional modularity supports pessimism about the prospects of emotions contributing positively to practical rationality here and now. This paper aims to respond to this criticism by demonstrating how models of emotion processing can accommodate the sorts of cognitive influence (...) required to make the pro-emotion position plausible whilst exhibiting key elements of modularity. (shrink)
Modular approaches to the architecture of the mind claim that some mental mechanisms, such as sensory input processes, operate in special-purpose subsystems that are functionally independent from the rest of the mind. This assumption of modularity seems to be in tension with recent claims that the mind has a predictive architecture. Predictive approaches propose that both sensory processing and higher-level processing are part of the same Bayesian information-processing hierarchy, with no clear boundary between perception and cognition. Furthermore, it is (...) not clear how any part of the predictive architecture could be functionally independent, given that each level of the hierarchy is influenced by the level above. Both the assumption of continuity across the predictive architecture and the seeming non-isolability of parts of the predictive architecture seem to be at odds with the modular approach. I explore and ultimately reject the predictive approach’s apparent commitments to continuity and non-isolation. I argue that predictive architectures can be modular architectures, and that we should in fact expect predictive architectures to exhibit some form of modularity. (shrink)
Amongst philosophers and cognitive scientists, modularity remains a popular choice for an architecture of the human mind, primarily because of the supposed explanatory value of this approach. Modular architectures can vary both with respect to the strength of the notion of modularity and the scope of the modularity of mind. We propose a dilemma for modular architectures, no matter how these architectures vary along these two dimensions. First, if a modular architecture commits to the informational encapsulation of (...) modules, as it is the case for modularity theories of perception, then modules are on this account impenetrable. However, we argue that there are genuine cases of the cognitive penetrability of perception and that these cases challenge any strong, encapsulated modular architecture of perception. Second, many recent massive modularity theories weaken the strength of the notion of module, while broadening the scope of modularity. These theories do not require any robust informational encapsulation, and thus avoid the incompatibility with cognitive penetrability. However, the weakened commitment to informational encapsulation greatly weakens the explanatory force of the theory and, ultimately, is conceptually at odds with the core of modularity. (shrink)
In this paper, I make a case for the modularity of the motor system. I start where many do in discussions of modularity, by considering the extent to which the motor system is cognitively penetrable, i.e., the extent to which its processing and outputs are causally influenced, in a semantically coherent way, by states of central cognition. I present some empirical findings from a range of sensorimotor adaptation studies that strongly suggest that there are limits to such influence (...) under certain conditions. These results cry out for an explanation. In the remainder of the paper, I provide one: The motor system is cognitively penetrable, but nonetheless modular along broadly Fodorian lines, insofar as it is informationally encapsulated. This means that its access is limited to its own proprietary database in computing its function from input to output, which does not include the information stored in central cognition. I then offer a model of action control, from distal intention to action outcomes, that further helps to illustrate this picture and can accommodate the target empirical findings. (shrink)
After presenting evidence about categorization behavior, this paper argues for the following theses: 1) that there is a border between perception and cognition; 2) that the border is to be characterized by perception being modular (and cognition not being so); 3) that perception outputs conceptualized representations, so views that posit that the output of perception is solely non-conceptual are false; and 4) that perceptual content consists of basic-level categories and not richer contents.
In this introduction, we give a brief overview of the main concepts of modularity that have been offered in recent literature. After this, we turn to a summary of the papers collected in this volume. Our primary aim is to explain how the modularity of emotion question relates to traditional debates in emotion theory.
Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either of these foundational purposes, and that recent attempts to defend the foundational importance of representation theorems are unsuccessful. As a result, we (...) should reject these claims, and lay the foundations of decision theory on firmer ground. (shrink)
Jury theorems are mathematical theorems about the ability of collectives to make correct decisions. Several jury theorems carry the optimistic message that, in suitable circumstances, ‘crowds are wise’: many individuals together (using, for instance, majority voting) tend to make good decisions, outperforming fewer or just one individual. Jury theorems form the technical core of epistemic arguments for democracy, and provide probabilistic tools for reasoning about the epistemic quality of collective decisions. The popularity of jury theorems spans across various disciplines such (...) as economics, political science, philosophy, and computer science. This entry reviews and critically assesses a variety of jury theorems. It first discusses Condorcet's initial jury theorem, and then progressively introduces jury theorems with more appropriate premises and conclusions. It explains the philosophical foundations, and relates jury theorems to diversity, deliberation, shared evidence, shared perspectives, and other phenomena. It finally connects jury theorems to their historical background and to democratic theory, social epistemology, and social choice theory. (shrink)
In this paper a symmetry argument against quantity absolutism is amended. Rather than arguing against the fundamentality of intrinsic quantities on the basis of transformations of basic quantities, e.g. mass doubling, a class of symmetries defined by the Π-theorem are used. This theorem is a fundamental result of dimensional analysis and shows that all unit-invariant equations which adequately represent physical systems can be put into the form of a function of dimensionless quantities. Quantity transformations that leave those dimensionless quantities invariant (...) are empirical and dynamical symmetries. The proposed symmetries of the original argument fail to be both dynamical and empirical symmetries and are open to counterexamples. The amendment of the original argument requires consideration of the relationships between quantity dimensions, particularly the constraint of dimensional homogeneity on our physical equations. The discussion raises a pertinent issue: what is the modal status of the constants of nature which figure in the laws? Two positions, constant necessitism and constant contingentism, are introduced and their relationships to absolutism and comparativism undergo preliminary investigation. It is argued that the absolutist can only reject the amended symmetry argument by accepting constant necessitism, which has a costly outcome: unit transformations are no longer symmetries. (shrink)
Ever since Chomsky, language has become the paradigmatic example of an innate capacity. Infants of only a few months old are aware of the phonetic structure of their mother tongue, such as stress-patterns and phonemes. They can already discriminate words from non-words and acquire a feel for the grammatical structure months before they voice their first word. Language reliably develops not only in the face of poor linguistic input, but even without it. In recent years, several scholars have extended this (...) uncontroversial view into the stronger claim that natural language is a human-speciﬁc adaptation. As I shall point out, this position is more problematic because of a lack of conceptual clarity over what human-specific cognitive adaptations are, and how they relate to modularity, the notion that mental phenomena arise from several domain-speciﬁc cognitive structures. The main aim of this paper is not to discuss whether or not language is an adaptation, but rather, to examine the concept of modularity with respect to the evolution and development of natural language. . (shrink)
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be obtained for extensions of description logics with special formulae that we call "role relational axioms." All sequent systems are sound, complete, and possess favorable properties such as height-preserving admissibility of common structural rules and height-preserving invertibility of rules.
The premise of biological modularity is an ontological claim that appears to come out of practice. We understand that the biological world is modular because we can manipulate different parts of organisms in ways that would only work if there were discrete parts that were interchangeable. This is the foundation of the BioBrick assembly method widely used in synthetic biology. It is one of a number of methods that allows practitioners to construct and reconstruct biological pathways and devices using (...) DNA libraries of standardized parts with known functions. In this paper, we investigate how the practice of synthetic biology reconfigures biological understanding of the key concepts of modularity and evolvability. We illustrate how this practice approach takes engineering knowledge and uses it to try to understand biological organization by showing how the construction of functional parts and processes can be used in synthetic experimental evolution. We introduce a new approach within synthetic biology that uses the premise of a parts-based ontology together with that of organismal self-organization to optimize orthogonal metabolic pathways in E. coli. We then use this and other examples to help characterize semisynthetic categories of modularity, parthood, and evolvability within the discipline. (shrink)
This paper compares current ways of modeling the inferential structure of practical reasoning arguments, and proposes a new approach in which it is regarded in a modular way. Practical reasoning is not simply seen as reasoning from a goal and a means to an action using the basic argumentation scheme. Instead, it is conceived as a complex structure of classificatory, evaluative, and practical inferences, which is formalized as a cluster of three types of distinct and interlocked argumentation schemes. Using two (...) real examples, we show how applying the three types of schemes to a cluster of practical argumentation allows an argument analyst to reconstruct the tacit premises presupposed and evaluate the argumentative reasoning steps involved. This approach will be shown to overcome the limitations of the existing models of practical reasoning arguments within the BDI and commitment theoretical frameworks, providing a useful tool for discourse analysis and other disciplines. In particular, applying this method brings to light the crucial role of classification in practical argumentation, showing how the ordering of values and preferences is only one of the possible areas of deep disagreement. (shrink)
We give a review and critique of jury theorems from a social-epistemology perspective, covering Condorcet’s (1785) classic theorem and several later refinements and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the ‘wisdom of crowds’. In particular, we argue (i) that there is a fundamental tension between voters’ independence and voters’ competence, hence between the two premises of most jury theorems; (ii) (...) that the (asymptotic) conclusion that ‘huge groups are infallible’, reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (nonasymptotic) conclusion that ‘larger groups are more reliable’, also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the ‘wisdom of crowds’. (shrink)
We suggest that pain processing has a modular architecture. We begin by motivating the (widely assumed but seldom defended) conjecture that pain processing comprises inferential mechanisms. We then note that pain exhibits a characteristic form of judgement independence. On the assumption that pain processing is inferential, we argue that its judgement independence is indicative of modular (encapsulated) mechanisms. Indeed, we go further, suggesting that it renders the modularity of pain mechanisms a default hypothesis to be embraced pending convincing counterevidence. (...) Finally, we consider what a modular pain architecture might look like, and question alleged counterevidence to our proposal. (shrink)
Introduction to Special Issue of Review of Philosophy and Psychology. Overview of the central issues in cognitive architecture, epistemology, and ethics surrounding cognitive penetrability. Special issue includes papers by philosophers and psychologists: Gary Lupyan, Fiona Macpherson, Reginald Adams, Anya Farennikova, Jona Vance, Francisco Marchi, Robert Cowan.
In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. Although we thereby (...) provide a new proof of Arrow’s theorem, our main aim is to identify the analogue of Arrow’s theorem in judgment aggregation, to clarify the relation between judgment and preference aggregation, and to illustrate the generality of the judgment aggregation model. JEL Classi…cation: D70, D71.. (shrink)
In this short survey article, I discuss Bell’s theorem and some strategies that attempt to avoid the conclusion of non-locality. I focus on two that intersect with the philosophy of probability: (1) quantum probabilities and (2) superdeterminism. The issues they raised not only apply to a wide class of no-go theorems about quantum mechanics but are also of general philosophical interest.
Functional robustness refers to a system’s ability to maintain a function in the face of perturbations to the causal structures that support performance of that function. Modularity, a crucial element of standard methods of causal inference and difference-making accounts of causation, refers to the independent manipulability of causal relationships within a system. Functional robustness appears to be at odds with modularity. If a function is maintained despite manipulation of some causal structure that supports that function, then the relationship (...) between that structure and function fails to be manipulable independent of other causal relationships within the system. Contrary to this line of reasoning, I argue that functional robustness often attends feedback control, rather than failures of modularity. Feedback control poses its own challenges to causal explanation and inference, but those challenges do not undermine modularity—and indeed, modularity is crucial to grappling with them. (shrink)
Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...) and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)
Due to the COVID-19 outbreak, education was interrupted. To continue offering high-quality education led to a dramatic transition away from face-to-face instruction and to blended learning. However, modular distance learning, as one of the adaptable learning modes, was chosen by most parents. Hence, this study seeks to determine the role of parents in the effectiveness of modular distance learning during the COVID-19 pandemic era, ascertain whether there is a relationship between the parents’ roles and their backgrounds, determine whether there is (...) a relationship between the parents’ backgrounds and the children’s academic performance and determine whether the child’s educational performance was related to the role of the parents. A survey questionnaire was used to acquire information on the parents’ profiles and the role they played or did not play. Mean, frequency count, and Spearman correlation were used to analyze the data. Results showed a relationship between parents’ profiles and roles in their child’s academic achievement. The children’s academic performance in modular distance learning is boosted, mainly if the parents work and earn a higher income. Modular distance learning is effective when parents act as friendly teachers and motivators for their children and are employed in either public or private agencies. -/- . (shrink)
Amalgamating evidence of different kinds for the same hypothesis into an overall confirmation is analogous, I argue, to amalgamating individuals’ preferences into a group preference. The latter faces well-known impossibility theorems, most famously “Arrow’s Theorem”. Once the analogy between amalgamating evidence and amalgamating preferences is tight, it is obvious that amalgamating evidence might face a theorem similar to Arrow’s. I prove that this is so, and end by discussing the plausibility of the axioms required for the theorem.
The standard representation theorem for expected utility theory tells us that if a subject’s preferences conform to certain axioms, then she can be represented as maximising her expected utility given a particular set of credences and utilities—and, moreover, that having those credences and utilities is the only way that she could be maximising her expected utility. However, the kinds of agents these theorems seem apt to tell us anything about are highly idealised, being always probabilistically coherent with infinitely precise degrees (...) of belief and full knowledge of all a priori truths. Ordinary subjects do not look very rational when compared to the kinds of agents usually talked about in decision theory. In this paper, I will develop an expected utility representation theorem aimed at the representation of those who are neither probabilistically coherent, logically omniscient, nor expected utility maximisers across the board—that is, agents who are frequently irrational. The agents in question may be deductively fallible, have incoherent credences, limited representational capacities, and fail to maximise expected utility for all but a limited class of gambles. (shrink)
The aggregation of individual judgments over interrelated propositions is a newly arising field of social choice theory. I introduce several independence conditions on judgment aggregation rules, each of which protects against a specific type of manipulation by agenda setters or voters. I derive impossibility theorems whereby these independence conditions are incompatible with certain minimal requirements. Unlike earlier impossibility results, the main result here holds for any (non-trivial) agenda. However, independence conditions arguably undermine the logical structure of judgment aggregation. I therefore (...) suggest restricting independence to premises, which leads to a generalised premise-based procedure. This procedure is proven to be possible if the premises are logically independent. (shrink)
The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a subspace (...) of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart. (shrink)
Perceptual processes, in particular modular processes, have long been understood as being mandatory. But exactly what mandatoriness amounts to is left to intuition. This paper identifies a crucial ambiguity in the notion of mandatoriness. Discussions of mandatory processes have run together notions of automaticity and ballisticity. Teasing apart these notions creates an important tool for the modularist's toolbox. Different putatively modular processes appear to differ in their kinds of mandatoriness. Separating out the automatic from the ballistic can help the modularist (...) diagnose and explain away some putative counterexamples to multimodal and central modules, thereby helping us to better evaluate the evidentiary status of modularity theory. (shrink)
This paper begins with a puzzle regarding Lewis' theory of radical interpretation. On the one hand, Lewis convincingly argued that the facts about an agent's sensory evidence and choices will always underdetermine the facts about her beliefs and desires. On the other hand, we have several representation theorems—such as those of (Ramsey 1931) and (Savage 1954)—that are widely taken to show that if an agent's choices satisfy certain constraints, then those choices can suffice to determine her beliefs and desires. In (...) this paper, I will argue that Lewis' conclusion is correct: choices radically underdetermine beliefs and desires, and representation theorems provide us with no good reasons to think otherwise. Any tension with those theorems is merely apparent, and relates ultimately to the difference between how 'choices' are understood within Lewis' theory and the problematic way that they're represented in the context of the representation theorems. For the purposes of radical interpretation, representation theorems like Ramsey's and Savage's just aren't very relevant after all. (shrink)
Pettit (2012) presents a model of popular control over government, according to which it consists in the government being subject to those policy-making norms that everyone accepts. In this paper, I provide a formal statement of this interpretation of popular control, which illuminates its relationship to other interpretations of the idea with which it is easily conflated, and which gives rise to a theorem, similar to the famous Gibbard-Satterthwaite theorem. The theorem states that if government policy is subject to popular (...) control, as Pettit interprets it, and policy responds positively to changes in citizens' normative attitudes, then there is a single individual whose normative attitudes unilaterally determine policy. I use the model and theorem as an illustrative example to discuss the role of mathematics in normative political theory. (shrink)
This paper generalises the classical Condorcet jury theorem from majority voting over two options to plurality voting over multiple options. The paper further discusses the debate between epistemic and procedural democracy and situates its formal results in that debate. The paper finally compares a number of different social choice procedures for many-option choices in terms of their epistemic merits. An appendix explores the implications of some of the present mathematical results for the question of how probable majority cycles (as in (...) Condorcet's paradox) are in large electorates. (shrink)
This paper is concerned with the construction of theories of software systems yielding adequate predictions of their target systems’ computations. It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions. Empirical theories of software systems are here introduced semantically, in terms of a hierarchy of computational models that are supplied by formal methods and testing techniques in computer science. Both deductive top-down and inductive bottom-up approaches in the discovery of (...) semantic software theories are refused to argue in favour of the abductive process of hypothesising and refining models at each level in the hierarchy, until they become satisfactorily predictive. Empirical theories of computational systems are required to be modular, as modular are most software verification and testing activities. We argue that logic relations must be thereby defined among models representing different modules in a semantic theory of a modular software system. We exclude that scientific structuralism is able to define module relations needed in software modular theories. The algebraic Theory of Institutions is finally introduced to specify the logic structure of modular semantic theories of computational systems. (shrink)
This paper deals with, prepositional calculi with strong negation (N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them.
Research in vision science, developmental psychology, and the foundations of cognitive science has led some theorists to posit referential mechanisms similar to indices. This hypothesis has been framed within a Fodorian conception of the early vision module. The article shows that this conception is mistaken, for it cannot handle the ‘interface problem’—roughly, how indexing mechanisms relate to higher cognition and conceptual thought. As a result, I reject the inaccessibility of early vision to higher cognition and make some constructive remarks on (...) the perception–cognition interface. -/- 1 The Case for Visual Indices 1.1 Preliminary assumptions 1.2 Transcendental arguments 1.3 Evidence from vision science 2 Visual Indices, Object Files, and Fodorian Modularity 3 The Interface Problem 3.1 Top-down attention and modularity 3.2 Selective attention and information 4 Revising the Indexing Hypothesis 4.1 Revising the perception–cognition interface 4.2 Revising the modularity of early vision 5 Concluding Remarks. (shrink)
Peer review is often taken to be the main form of quality control on academic research. Usually journals carry this out. However, parts of maths and physics appear to have a parallel, crowd-sourced model of peer review, where papers are posted on the arXiv to be publicly discussed. In this paper we argue that crowd-sourced peer review is likely to do better than journal-solicited peer review at sorting papers by quality. Our argument rests on two key claims. First, crowd-sourced peer (...) review will lead on average to more reviewers per paper than journal-solicited peer review. Second, due to the wisdom of the crowds, more reviewers will tend to make better judgments than fewer. We make the second claim precise by looking at the Condorcet Jury Theorem as well as two related jury theorems developed specifically to apply to peer review. (shrink)
Our conscious minds exist in the Universe, therefore they should be identified with physical states that are subject to physical laws. In classical theories of mind, the mental states are identified with brain states that satisfy the deterministic laws of classical mechanics. This approach, however, leads to insurmountable paradoxes such as epiphenomenal minds and illusionary free will. Alternatively, one may identify mental states with quantum states realized within the brain and try to resolve the above paradoxes using the standard Hilbert (...) space formalism of quantum mechanics. In this essay, we first show that identification of mind states with quantum states within the brain is biologically feasible, and then elaborating on the mathematical proofs of two quantum mechanical no-go theorems, we explain why quantum theory might have profound implications for the scientific understanding of one's mental states, self identity, beliefs and free will. (shrink)
Famous results by David Lewis show that plausible-sounding constraints on the probabilities of conditionals or evaluative claims lead to unacceptable results, by standard probabilistic reasoning. Existing presentations of these results rely on stronger assumptions than they really need. When we strip these arguments down to a minimal core, we can see both how certain replies miss the mark, and also how to devise parallel arguments for other domains, including epistemic “might,” probability claims, claims about comparative value, and so on. A (...) popular reply to Lewis's results is to claim that conditional claims, or claims about subjective value, lack truth conditions. For this strategy to have a chance of success, it needs to give up basic structural principles about how epistemic states can be updated—in a way that is strikingly parallel to the commitments of the project of dynamic semantics. (shrink)
Following a long-standing philosophical tradition, impartiality is a distinctive and determining feature of moral judgments, especially in matters of distributive justice. This broad ethical tradition was revived in welfare economics by Vickrey, and above all, Harsanyi, under the form of the so-called Impartial Observer Theorem. The paper offers an analytical reconstruction of this argument and a step-wise philosophical critique of its premisses. It eventually provides a new formal version of the theorem based on subjective probability.
To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn Yablo's paradox, the most challenging paradox in the recent years, into a genuine mathematical theorem in Linear Temporal Logic (LTL). Indeed, Yablo's paradox comes in several varieties; and he showed in 2004 that there are other versions that are equally paradoxical. Formalizing these versions (...) of Yablo's paradox, we prove some theorems in LTL. This is the first time that Yablo's paradox(es) become new(ly discovered) theorems in mathematics and logic. (shrink)
It is shown that the Fodor's interpretation of the frame problem is the central indication that his version of the Modularity Thesis is incompatible with computationalism. Since computationalism is far more plausible than this thesis, the latter should be rejected.
In the context of EPR-Bohm type experiments and spin detections confined to spacelike hypersurfaces, a local, deterministic and realistic model within a Friedmann-Robertson-Walker spacetime with a constant spatial curvature (S^3 ) is presented that describes simultaneous measurements of the spins of two fermions emerging in a singlet state from the decay of a spinless boson. Exact agreement with the probabilistic predictions of quantum theory is achieved in the model without data rejection, remote contextuality, superdeterminism or backward causation. A singularity-free Clifford-algebraic (...) representation of S^3 with vanishing spatial curvature and non-vanishing torsion is then employed to transform the model in a more elegant form. Several event-by-event numerical simulations of the model are presented, which confirm our analytical results with the accuracy of 4 parts in 10^4 . Possible implications of our results for practical applications such as quantum security protocols and quantum computing are briefly discussed. (shrink)
In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...) = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)
Medical science conceives the human body as a system comprised of many subsystems at a variety of levels. At the highest level are bodily systems proper, such as the endocrine system, which are central to our understanding of human anatomy, and play a key role in diagnosis and in dynamic modeling as well as in medical pedagogy and computer visualization. But there is no explicit definition of what a bodily system is; such informality is acceptable in documentation created for human (...) beings, but falls short of what is needed for computer representations. Our analysis is intended as a first step towards filling this gap. (shrink)
We note that a plural version of logicism about arithmetic is suggested by the standard reading of Hume's Principle in terms of `the number of Fs/Gs'. We lay out the resources needed to prove a version of Frege's principle in plural, rather than second-order, logic. We sketch a proof of the theorem and comment philosophically on the result, which sits well with a metaphysics of natural numbers as plural properties.
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
Email
RSS feed
About us
Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.