This study focuses on the devices implemented in classical Indian texts on ritual and language in order to develop a structure of rules in an economic and systematic way. These devices presuppose a spatial approach to ritual and language, one which deals for instance with absences as substitutions within a pre-existing grid, and not as temporal disappearances. In this way, the study reveals a key feature of some among the most influential schools of Indian thought. The sources are Kalpasūtra, (...) Vyākaraṇa and Mīmāṃsā, three textual traditions which developed alongside each other, sharing - as the volume shows - common presuppositions and methodologies. The book will be of interest for Sanskritists, scholars of ritual exegesis and of the history of linguistics. - Cover. (shrink)

In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language (a decidable system with the same complexity as orthodox propositional modal logic) to the strong Priorean language (which offers full first-order expressivity).We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a (...) wide variety of frame classes and to prove completeness using the Henkin method. In the weaker languages, this requires the use of non-orthodox rules. We discuss these rules in detail and prove non-eliminability and eliminability results. We also show how another type of rule, which reflects the structure of the strong Priorean language, can be employed to give an even wider coverage of frame classes. We show that this deductive apparatus gets progressively simpler as we work our way up the expressivity hierarchy, and conclude the paper by showing that the approach transfers to first-order hybrid logic. (shrink)

An extension L + of the non-associative Lambek calculus Lis defined. In L + the restriction to formula-conclusion sequents is given up, and additional left introduction rules for the directional implications are introduced. The system L + is sound and complete with respect to a modification of the ternary frame semantics for L.

The Ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega $$\end{document}-rule was introduced by W. Buchholz to give an ordinal-free proof of cut-elimination for a subsystem of analysis with Π11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi ^{1}_{1}$$\end{document}-comprehension. W. Buchholz’s proof provides cut-free derivations by familiar rules only for arithmetical sequents. When second-order quantifiers are present, they are introduced by the Ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega $$\end{document}-rule and some residual cuts are (...) not eliminated. In the present paper, we introduce an extension of the Ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega $$\end{document}-rule and prove the complete cut-elimination by the same method as W. Buchholz: any derivation of arbitrary sequent is transformed into its cut-free derivation by the standard rules. In fact we treat the subsystem of Π11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi ^{1}_{1}$$\end{document}-CA that W. Buchholz used for his explanation of G. Takeuti’s finite reductions. Extension to full Π11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi ^{1}_{1}$$\end{document}-CA is planned for another paper. (shrink)

The hypothesis of extended cognition holds that mental states and processes need not be wholly contained within biological confines. Yet the theory is plausible, and informative, only when it can set principled outer limits upon cognitive extension: it should not permit unrestricted expansion of the mental into the material environment. I argue that true cognitive extension occurs only when the subject takes responsibility for the contribution made by a non-neural resource, in a manner that can be illuminated by (...) appeal to theoretical resources from contemporary virtue epistemology. (shrink)

In this article, the authors try to answer the following questions: How can an object/instance seen for the first time extend a category or update a concept? How is it possible to determine the reference of a concept that represents a behaviour? In the first case, the authors discuss the learning of inferential linguistic competence used to update a concept through an approach based on prototype theory. In the second case, the authors discuss the learning of referential linguistic competence used (...) to determine the reference of a concept (i.e., determination of an actual behaviour) through an approach based on embodied cognition. The authors show how combining prototype-based and embodied categorization in Wittgenstein’s rule-following praxis (the individual and community dimension), linguistic learning of a concept (inferential competence), and determination of its reference (referential competence) can be traced back to the same model. Keywords Action, Categorization, Embodied Cognition, Embodiment, Linguistic Inferential Competence, Linguistic Referential Competence, Perception, Prototype Theory, Reference, Sign. (shrink)

The contraction-free sequent calculus G4 for intuitionistic logic is extended by rules following a general rule-scheme for nonlogical axioms. Admissibility of structural rules for these extensions is proved in a direct way by induction on derivations. This method permits the representation of various applied logics as complete, contraction- and cut-free sequent calculus systems with some restrictions on the nature of the derivations. As specific examples, intuitionistic theories of apartness and order are treated.

One lists the distinct pairs of categorical premises formulable via only the positive terms, S,P,M, by constructing a six by six matrix obtained by pairing the six categorical P-premises, A, O, A, O, where P* ∈ {P,P′}, with the six, similar, categorical S-premises. One shows how five rules of valid syllogism, select only 15 distinct PCPs that entail logical consequences belonging to the set L+: = {A, O, A, E, O, I}. The choice of admissible LCs can be regarded (...) as a condition separated from the conditions contained in the RofVS: the usual eight PCPs that generate valid syllogisms are obtained when the only admissible LCs belong to the set L: = {A, E, O, I} and no existential imports are addressed. A 64 PCP-matrix obtains when both PCPs and LCs may contain indefinite terms—the positive, S,P,M, terms, and their complementary sets, S′,P′, M′, in the universe of discourse, U, called the negative terms. Now one can accept eight LCs: A, I, where P* ∈ {P,P′}, S* ∈ {S,S′}, and there are 32 conclusive PCPs, entailing precise, “one partitioning subset of U” LCs. The four rules of conclusive syllogisms predict the less precise LCs, left after eliminating the middle term from the exact LCs. The RofCS also predict that the other 32 PCPs of the 64 PCP-matrix are non-conclusive. The RofVS and the RofCS are generalized, and arguments are given, for also accepting as valid syllogisms the conclusive syllogisms formulable via positive terms which entail the LCs A and O. (shrink)

With any structural inference rule A/B, we associate the rule $${(A \lor p)/(B \lor p)}$$, providing that formulas A and B do not contain the variable p. We call the latter rule a join-extension ( $${\lor}$$ -extension, for short) of the former. Obviously, for any intermediate logic with disjunction property, a $${\lor}$$ -extension of any admissible rule is also admissible in this logic. We investigate intermediate logics, in which the $${\lor}$$ -extension of each admissible rule is (...) admissible. We prove that any structural finitary consequence operator (for intermediate logic) can be defined by a set of $${\lor}$$ -extended rules if and only if it can be defined through a set of well-connected Heyting algebras of a corresponding quasivariety. As we exemplify, the latter condition is satisfied for a broad class of algebraizable logics. (shrink)

We develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC, by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in the logic, or it is equivalent to an assumption-free rule. Other applications of canonical rules include (...) a generalization of the Blok–Esakia theorem and the theory of modal companions to systems of multiple-conclusion rules or (finitary structural global) consequence relations, and a characterization of splittings in the lattices of consequence relations over monomodal or superintuitionistic logics with the finite model property. (shrink)

We discuss a `negative' way of defining frame classes in (multi)modal logic, and address the question of whether these classes can be axiomatized by derivation rules, the `non-ξ rules', styled after Gabbay's Irreflexivity Rule. The main result of this paper is a metatheorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formulas and Λ+ is the extension of Λ with a set of non-ξ (...) class='Hi'>rules, then Λ+ is strongly sound and complete with respect to the class of frames determined by the axioms and the rules. (shrink)

Intuitionistic sentential logic is shown to be sound and complete with respect to a semantics centered around extensions of atomic bases (i.e. sets of inference rules for atomic sentences). The result is made possible through a non-standard interpretation of disjunction, whereby, roughly speaking, a disjunction is taken to hold just in case every atomic sentence that follows from each of the disjuncts separately holds; it is argued that this interpretation makes good sense provided that rules in atomic bases (...) are conceived of as being accepted hypothetically rather than categorically. (shrink)

In The Rules of Insanity, Carl Elliott draws on philosophy and psychiatry to develop a conceptual framework for judging the moral responsibility of mentally ill offenders. Arguing that there is little useful that can be said about the responsibility of mentally ill offenders in general, Elliott looks at specific mental illnesses in detail; among them schizophrenia, manic-depressive disorders, psychosexual disorders such as exhibitionism and voyeurism, personality disorders, and impulse control disorders such as kleptomania and pyromania. He takes a particularly (...) hard look at the psychopath or sociopath, who many have argued is incapable of understanding morality. Making extensive use of psychiatric case histories, Elliott explores the various ways in which mental illness can affect a person's intentions and thus excuse him or her from moral responsibility. (shrink)

The paper considers certain extensions of the system LC introduced in Dunn & Meyer 1997. LC is a structurally free system , but it has combinators as formulas in the place of structural rules. We consider two ways to extend LC with conjunction and disjunction depending on whether they distribute over each other or not. We prove the elimination theorem for the systems. At the end of the paper we give a Routley-Meyer style semantics for the distributive extension, (...) including some new definitions and an algorithm which are used in proving a representation theorem in general, i.e., for arbitrary combinators. (shrink)

Over the last decade, philosophers of science have extensively criticized the epistemic superiority of randomized controlled trials for testing safety and effectiveness of new drugs, defending instead various forms of evidential pluralism. We argue that scientific methods in regulatory decision-making cannot be assessed in epistemic terms only: there are costs involved. Drawing on the legal distinction between rules and standards, we show that drug regulation based on evidential pluralism has much higher costs than our current RCT-based system. We analyze (...) these costs and advocate for evaluating any scheme for drug regulatory tests in terms of concrete empirical benchmarks, like the error rates of regulatory decisions. (shrink)

Of all the cases made against classical logic, Michael Dummett's is the most deeply considered. Issuing from a systematic and original conception of the discipline, it constitutes one of the most distinctive achievements of twentieth century British philosophy. Although Dummett builds on the work of Brouwer and Heyting, he provides the case against classical logic with a new, explicit and general foundation in the philosophy of language. Dummett's central arguments, widely celebrated if not widely endorsed, concern the implications of the (...) relation between meaning and use for both the inference rules that govern logical connectives and the relation between truth and its recognition. It is less often noted that Dummett has a further argument against classical logic, one based on the semantic and set-theoretic paradoxes. That is the topic of this paper. (shrink)

Natural deduction with alternatives extends Gentzen–Prawitz-style natural deduction with a single structural addition: negatively signed assumptions, called alternatives. It is a mildly bilateralist, single-conclusion natural deduction proof system in which the connective rules are unmodi_ed from the usual Prawitz introduction and elimination rules — the extension is purely structural. This framework is general: it can be used for (1) classical logic, (2) relevant logic without distribution, (3) affine logic, and (4) linear logic, keeping the connective rules (...) fixed, and varying purely structural rules. The key result of this paper is that the two principles that introduce kinds of irrelevance to natural deduction proofs: (a) the rule of explosion (from a contradiction, anything follows); and (b) the structural rule of vacuous discharge; are shown to be two sides of a single coin, in the same way that they correspond to the structural rule of weakening in the sequent calculus. The paper also includes a discussion of assumption classes, and how they can play a role in treating additive connectives in substructural natural deduction. (shrink)

Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication–negation fragments of intuitionistic logic and its consistent axiomatic extensions . A Kripke semantics characterization is given for the structurally complete implication–negation fragments of intermediate logics, and it is shown that the admissible rules of this fragment of form a PSPACE-complete set and have no finite basis.

A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for k < ω, (...) k times iterated ∑n reflection principle over EA precisely corresponds to the extension of EA by k nested applications of ∑n induction rule.The above relationship holds in greater generality than just stated. In fact, we give general formulas characterizing in terms of iterated reflection principles the extension of any given theory by k nested applications of ∑n or Πn induction rules. In particular, the closure of a theory T under just one application of ∑1 induction rule is equivalent to T together with ∑1 reflection principle for each finite Π2 axiomatized subtheory of T.These results have closely parallel ones in the theory of subrecursive function classes. The rules under study correspond, in a canonical way, to natural closure operators on the classes of provably recursive functions. Thus, ∑1 induction rule precisely corresponds to the primitive recursive closure operator, and ∑1 collection rule, introduced below, corresponds to the elementary closure operator. (shrink)

Large portions of mathematics such as algebra and geometry can be formalized using first-order axiomatizations. In many cases it is even possible to use a very well-behaved class of first-order axioms, namely, what are called coherent or geometric implications. Such class of axioms can be translated to inference rules that can be added to a sequent calculus while preserving its structural properties. In this work, this fundamental result is extended to their infinitary generalizations as extensions of sequent calculi for (...) both classical and intuitionistic infinitary logic. As an application, a simple proof of the infinitary Barr’s theorem without the axioms of choice is shown. (shrink)

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal (...) systems K, KT , K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

The paper first summarizes the author's decision-theoretical model of moral behavior, in order to compare the moral implications of the act-utilitarian and of the rule-utilitarian versions of utilitarian theory. This model is then applied to three voting examples. It is argued that the moral behavior of act-utilitarian individuals will have the nature of a noncooperative game, played in the extensive mode, and involving action-by-action maximization of social utility by each player. In contrast, the moral behavior of rule-utilitarian individuals will have (...) the nature of a cooperative game, played in the normal mode, and involving a firm commitment by each player to a specific moral strategy (viz. to the strategy selected by the rule-utilitarian choice criterion) — even if some individual actions prescribed by this strategy, when considered in isolation, should fail to maximize social utility. The most important advantage that rule utilitarianism as an ethical theory has over act utilitarianism lies in its ability to give full recognition to the moral and social importance of individual rights and personal obligations. It is easy to verify that action-by-action maximization of social utility, as required by act utilitarianism, would destroy these rights and obligations. In contrast, rule utilitarianism can fully recognize the moral validity of these rights and obligations precisely because of its commitment to an overall moral strategy, independent of action-by-action social-utility maximization. The paper ends with a discussion of the voter's paradox problem. The conventional theory of rational behavior cannot avoid the paradoxical conclusion that, in any large electorate, voting is always an irrational activity because one's own individual vote is extremely unlikely to make any difference to the outcome of any election. But it can be shown that, by using the principles of rule-utilitarian theory, this paradox can easily be resolved and that, in actual fact, voting, even in large electorates, may be perfectly rational action. More generally, the example of rule utilitarianism shows what an important role the concept of a rational commitment can play in the analysis of rational behavior. (shrink)

Hilbert developed his famous finitist point of view in several essays in the 1920s. In this paper, we discuss various extensions of it, with particular emphasis on those suggested by Hilbert and Bernays in Grundlagen der Mathematik (vol. I 1934, vol. II 1939). The paper is in three sections. The first deals with Hilbert's introduction of a restricted ? -rule in his 1931 paper ?Die Grundlegung der elementaren Zahlenlehre?. The main question we discuss here is whether the finitist (meta-)mathematician would (...) be entitled to accept this rule as a finitary rule of inference. In the second section, we assess the strength of finitist metamathematics in Hilbert and Bernays 1934. The third and final section is devoted to the second volume of Grundlagen der Mathematik. For preparatory reasons, we first discuss Gentzen's proposal of expanding the range of what can be admitted as finitary in his esssay ?Die Widerspruchsfreiheit der reinen Zahlentheorie? (1936). As to Hilbert and Bernays 1939, we end on a ?critical? note: however considerable the impact of this work may have been on subsequent developments in metamathematics, there can be no doubt that in it the ideals of Hilbert's original finitism have fallen victim to sheer proof-theoretic pragmatism. (shrink)

In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems (...) |$K$|⁠, |$KT$|⁠, |$K4$| and |$S4$|⁠, with |$\square $| as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between |$\square $| and a natural presentation of |$\lozenge $|⁠. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

0. Introductory remarks. I assume that every serious theory of language must give some explicit account of the relationship between expressions in the language described and expressions in some interpreted language which spells out the semantics of the language.1 Let's call this relationship the translation relation. Theories differ as to how this relation is specified. In the Aspects theory of syntax, taken together with a Katz-Postal view of "semantic rules", it was assumed that the relation was defined on deep (...) structures. Serious problems led to modifications of this view in several directions. Chomsky's latest papers assume that a modified 'intermediate structure' is transformed by rules of interpretation to a level of representation called 'logical form'. Common to all of these approaches is the assumption that the translation rules are defined initially on syntactic structures of one sort or another. Let us call this assumption the configurational hypothesis: the translation rules all have the form: [183]. (shrink)

We contrast three decision rules that extend Expected Utility to contexts where a convex set of probabilities is used to depict uncertainty: Γ-Maximin, Maximality, and E-admissibility. The rules extend Expected Utility theory as they require that an option is inadmissible if there is another that carries greater expected utility for each probability in a (closed) convex set. If the convex set is a singleton, then each rule agrees with maximizing expected utility. We show that, even when the option (...) set is convex, this pairwise comparison between acts may fail to identify those acts which are Bayes for some probability in a convex set that is not closed. This limitation affects two of the decision rules but not E-admissibility, which is not a pairwise decision rule. E-admissibility can be used to distinguish between two convex sets of probabilities that intersect all the same supporting hyperplanes. (shrink)

Rule-applying legal arguments are traditionally treated as a kind of syllogism. Such a treatment overlooks the fact that legal principles and rules are not statements which describe the world, but rather means by which humans impose structure on the world. Legal rules create legal consequences, they do not describe them. This has consequences for the logic of rule- and principle-applying arguments, the most important of which may be that such arguments are defeasible. This book offers an extensive analysis (...) of the role of rules and principles in legal reasoning, which focuses on the close relationship between rules, principles, and reasons. Moreover, it describes a logical theory which assigns a central place to the notion of reasons for and against a conclusion, and which is especially suited to deal with rules and principles. (shrink)

An examination of the role played by general rules in Hume's positive (nonskeptical) epistemology. General rules for Hume are roughly just general beliefs. The difference between justified and unjustified belief is a matter of the influence of good versus bad general rules, the good general rules being the "extensive" and "constant" ones.

Legal contracts and litigation documents common to the American legal system were encoded in the eXtensible Markup Language (XML). XML also represents rules about the contracts and litigation procedure. In addition to an expert system tool that allows one to make inferences with that engine, a Graphical User Interface (GUI) generates the XML representing the rules. A rulebase is developed by marking up examples of the XML to be interpreted and the XML to be generated, analogously to Query (...) By Example. This article provides a broader context of the synergy between XML and artificial intelligence by including discussions of: (1) the role of Artificial Intelligence in handling routine litigation; (2) how the use of XML enables legal expert systems to get their `input' without the user having to enter the same information again for the expert system;(3) the advantages of XML markup over other forms of markup for documents; (4) the relationship between XML and ontologies; (5) other projects using XML with rules or legal affairs. (shrink)

This paper is devoted to the complete axiomatization of dynamic extensions of arrow logic based on a restriction of propositional dynamic logic with intersection. Our deductive systems contain an unorthodox inference rule: the inference rule of intersection. The proof of the completeness of our deductive systems uses the technique of the canonical model.

This article provides a brief review of Saybrook Review, Vol 6, No. 1, Spring 1986. Special issue: Extensions in Human Science Methodology guest edited by Donald E. Polkinghorne. This issue contains articles written by four of the faculty of the Saybrook Institute, all of which examine "the consequences of extending the criteria of science beyond the traditional objectivism-relativism dichotomy." Polkinghorne's lead article is a compelling and clear historical characterization of the place of human science in today's academic world. The second (...) is an article by Anthony Stigliano that proposes "an ontology for the human sciences" where research would be grounded in a language of description that is "incomplete, discontinuous, dialogal, and interlaced with different 'levels' of discourse". Jurgen Kremer's article reviews prevailing views of reason and truth, and makes a proposal "for the development of narratives of truths...that consciously include moral and aesthetic dimensions." The final article is by Marcia Salner and is a piece that explores the question of validity in human science research, paying particular attention to "the central role of linguistic communication as a major data source, and to the role of communal negotiation and juridical rules for dealing with conflicting interpretations." Together these articles make a positive advance toward the understanding of the context as well as consequences of an epistemological position that stresses contextual relativism and embraces methodological pluralism. 2012 APA, all rights reserved). (shrink)

The purpose of this paper is to investigate the relationship between collective rationality and permissible collective choice rules using a unified approach inspired by Bossert and Suzumura (J Econ Theory 138:311–320, 2008). We consider collective choice rules satisfying four axioms: unrestricted domain, strong Pareto, anonymity, and neutrality. A number of new classes of collective choice rules as well as the Pareto and Pareto extension rules are characterized under various concepts of collective rationality: acyclicity, transitivity, quasi-transitivity, (...) semi-transitivity, and the interval order property. Further, new concepts of collective rationality, K-term acyclicity and K-term consistency, are proposed and the corresponding characterizations are provided. (shrink)

This paper contains a detailed account of the notion of admissibility in the setting of consequence relations. It is proved that the two notions of admissibility used in the literature coincide, and it provides an extension to multi–conclusion consequence relations that is more general than the one usually encountered in the literature on admissibility. The notion of a rule scheme is introduced to capture rules with side conditions, and it is shown that what is generally understood under the (...) extension of a consequence relation by a rule can be extended naturally to rule schemes, and that such extensions capture the intuitive idea of extending a logic by a rule. (shrink)

Proof-theoretic semantics is an inferentialist theory of meaning originally developed in a unilateral framework. Its extension to bilateral systems opens both opportunities and problems. The problems are caused especially by Coordination Principles (a kind of rule that is not present in unilateral systems) and mismatches between rules for assertion and rules for rejection. In this paper, a solution is proposed for two major issues: the availability of a reduction procedure for tonk and the existence of harmonious (...) class='Hi'>rules for the paradoxical zero-ary connective \(\bullet\). The solution is based on a reinterpretation of bilateral rules as complex rules, that is, rules that introduce or eliminate connectives in a subordinate position. Looking at bilateral rules from this perspective, the problems faced by bilateralism can be seen as special cases of general problems of complex systems, which have been already analyzed in the literature. In the end, a comparison with other proposed solutions underlines the need for further investigation in order to complete the picture of bilateral proof-theoretic semantics. (shrink)

We present axiom systems, and provide soundness and strong completeness theorems, for classes of Kripke models with restricted extension rules among the node structures of the model. As examples we present an axiom system for the class of cofinal extension Kripke models, and an axiom system for the class of end-extension Kripke models. We also show that Heyting arithmetic is strongly complete for its class of end-extension models. Cofinal extension models of HA are models (...) of Peano arithmetic. (shrink)

Wischik presents an extensive reply to our paper on conscientious objection, which explores the implications of distinguishing ‘medical acts’ from ‘socioclinical acts’. He provides an extensive leg...

In many voting systems, voters’ preferences on a set of candidates are represented by linear orderings. In this context, scoring rules are well-known procedures to aggregate the preferences of the voters. Under these rules, each candidate obtains a fixed number of points, sk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_k$$\end{document}, each time he/she is ranked k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}th by one voter and the candidates are ordered according to the total (...) number of points they receive. In order to identify the best scoring rule to use in each situation, we need to know which properties are met by each of these procedures. Although some properties have been analyzed extensively, there are other properties that have not been studied for all scoring rules. In this paper, we consider two desirable social choice properties, the Pareto-optimality and the immunity to the absolute loser paradox, and establish characterizations of the scoring rules that satisfy each of these specific axioms. Moreover, we also provide a proof of a result given by Saari and Barney, where the scoring rules meeting reversal symmetry are characterized. From the results of characterization, we establish some relationships among these properties. Finally, we give a characterization of the scoring rules satisfying the three properties. (shrink)

This volume of new work by prominent phonologists goes to the heart of current debates in phonological and linguistic theory: should the explanation of phonological variety be constraint or rule-based and, in the light of the resolution of this question, how in the mind does phonology interface with other components of the grammar. The book includes contributions from leading proponents of both sides of the argument and an extensive introduction setting out the history, nature, and more general linguistic implications of (...) current phonological theory. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in (...) just those models. I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

In this work I bring a conception of language and meaning as a shared institution to bear upon rule-following scepticism, i.e., upon the sceptical problem concerning the semantic determinacy of expressions involving infinite or indefinitely large and open extensions. Such scepticism proceeds from the observation that the extensions of expressions of this kind are not uniquely determined by epistemically accessible facts, to conclude that the expressions in question are indeterminate in point of extension, and that their meaning must consist (...) in their use. ;In the first chapter of this work, I argue that rule-following considerations by themselves do not suffice to establish these conclusions, and that additional premises are needed. I consider both internalist and extensionalist schemes to supplement the sceptical argument. I find such schemes lacking in persuasive support. Chapter 2, in particular, concentrates on Kripke's well known exegesis of Wittgenstein's argument, and on the internalist requirements upon which it is based. ;In Chapter 3, I offer an externalist account of the normative aspect in rule following. On the account I give, the rule one is projecting is determined extensionally by one's position in a community in which his projections would be corrected and evaluated by other members, and from which one has acquired the rule in the first place through a chain of communication, rather than by one's own projections, taken in isolation, which constitute only a partial understanding of the rule in question. This account is not designed to refute scepticism; rather its aim is to account for the normativity of rule-following in ways which do not invoke the internalist requirement upon which rule following scepticism is based. (shrink)

An attempt is made to include the axioms of Mackey for probabilities of experiments in quantum mechanics into the calculus x0 of ukasiewicz. The obtained calculusQ contains an additional modal signQ and four modal rules of inference. The propositionQx is read x is confirmed. The most specific rule of inference may be read: for comparable observations implication is equivalent to confirmation of material implication.The semantic truth ofQ is established by the interpretation with the help of physical objects obeying to (...) the rules of quantum mechanics. The embedding of the usual quantum propositional logic inQ is accomplished. (shrink)

All extensions of the modal Grzegorczyk logic Grz possessing projective Beth's property PB2 are described. It is proved that there are exactly 13 logics over Grz with PB2. All of them are finitely axiomatizable and have the finite model property. It is shown that PB2 is strongly decidable over Grz, i.e. there is an algorithm which, for any finite system Rul of additional axiom schemes and rules of inference, decides if the calculus Grz+Rul has the projective Beth property.

May's Theorem [K. O. May, Econometrica 20 (1952) 680-684] characterizes majority voting on two alternatives as the unique preferential voting method satisfying several simple axioms. Here we show that by adding some desirable axioms to May's axioms, we can uniquely determine how to vote on three alternatives. In particular, we add two axioms stating that the voting method should mitigate spoiler effects and avoid the so-called strong no show paradox. We prove a theorem stating that any preferential voting method satisfying (...) our enlarged set of axioms, which includes some weak homogeneity and preservation axioms, agrees with Minimax voting in all three-alternative elections, except perhaps in some improbable knife-edged elections in which ties may arise and be broken in different ways. (shrink)

_ Source: _Page Count 19 In this paper, we tackle the contribution that history of science can make to the _problem of rule-choice_, i.e., the choice from among competing methodological rules. Taking our cue from Larry Laudan’s writings, we extensively discuss what we call _historicist naturalism_, i.e., the view that history of science plays a pivotal role in the justification of rules, since it is one source of the evidence required to settle methodological controversies. As we illustrate, there (...) are cases of rule-choice that depend on conceptual considerations alone, and in which history of science does not factor. Moreover, there are cases in which methodological change is prompted – and explained – by empirical information that is not historical in nature: as suggested by what we call _scientific naturalism_, the justification of methodological choices comes from our knowledge of the structure of the world, as expressed by our currently accepted scientific theories. As we argue, due to its backward-looking character, historicist naturalism does not satisfactorily deal with the case of newly introduced rules, for which no evidence concerning their past performance is available. In sum, we conclude, the contribution that history of science can make to rule-choice is more modest than Laudan suggests. (shrink)