5,279 research outputs found

    Homogeneity and the illocutionary force of rejection

    Get PDF
    Homogeneity inferences arise whenever an assertion implies a universal positive (every/both) and its denial implies a universal negative (no/neither). I present an account of homogeneity inferences based on two assumptions which together constrain the behavior of negation: rejection is non-classical, and vacuous models may be omitted (Neglect Zero). If both assumptions are enforced, the only definable negatives are universal (no/neither), predicting the homogeneity gap

    A foundation for synthesising programming language semantics

    Get PDF
    Programming or scripting languages used in real-world systems are seldom designed with a formal semantics in mind from the outset. Therefore, the first step for developing well-founded analysis tools for these systems is to reverse-engineer a formal semantics. This can take months or years of effort. Could we automate this process, at least partially? Though desirable, automatically reverse-engineering semantics rules from an implementation is very challenging, as found by Krishnamurthi, Lerner and Elberty. They propose automatically learning desugaring translation rules, mapping the language whose semantics we seek to a simplified, core version, whose semantics are much easier to write. The present thesis contains an analysis of their challenge, as well as the first steps towards a solution. Scaling methods with the size of the language is very difficult due to state space explosion, so this thesis proposes an incremental approach to learning the translation rules. I present a formalisation that both clarifies the informal description of the challenge by Krishnamurthi et al, and re-formulates the problem, shifting the focus to the conditions for incremental learning. The central definition of the new formalisation is the desugaring extension problem, i.e. extending a set of established translation rules by synthesising new ones. In a synthesis algorithm, the choice of search space is important and non-trivial, as it needs to strike a good balance between expressiveness and efficiency. The rest of the thesis focuses on defining search spaces for translation rules via typing rules. Two prerequisites are required for comparing search spaces. The first is a series of benchmarks, a set of source and target languages equipped with intended translation rules between them. The second is an enumerative synthesis algorithm for efficiently enumerating typed programs. I show how algebraic enumeration techniques can be applied to enumerating well-typed translation rules, and discuss the properties expected from a type system for ensuring that typed programs be efficiently enumerable. The thesis presents and empirically evaluates two search spaces. A baseline search space yields the first practical solution to the challenge. The second search space is based on a natural heuristic for translation rules, limiting the usage of variables so that they are used exactly once. I present a linear type system designed to efficiently enumerate translation rules, where this heuristic is enforced. Through informal analysis and empirical comparison to the baseline, I then show that using linear types can speed up the synthesis of translation rules by an order of magnitude

    A decision-making framework based on the Fermatean hesitant fuzzy distance measure and TOPSIS

    Get PDF
    A particularly useful assessment tool for evaluating uncertainty and dealing with fuzziness is the Fermatean fuzzy set (FFS), which expands the membership and non-membership degree requirements. Distance measurement has been extensively employed in several fields as an essential approach that may successfully disclose the differences between fuzzy sets. In this article, we discuss various novel distance measures in Fermatean hesitant fuzzy environments as research on distance measures for FFS is in its early stages. These new distance measures include weighted distance measures and ordered weighted distance measures. This justification serves as the foundation for the construction of the generalized Fermatean hesitation fuzzy hybrid weighted distance (DGFHFHWD) scale, as well as the discussion of its weight determination mechanism, associated attributes and special forms. Subsequently, we present a new decision-making approach based on DGFHFHWD and TOPSIS, where the weights are processed by exponential entropy and normal distribution weighting, for the multi-attribute decision-making (MADM) issue with unknown attribute weights. Finally, a numerical example of choosing a logistics transfer station and a comparative study with other approaches based on current operators and FFS distance measurements are used to demonstrate the viability and logic of the suggested method. The findings illustrate the ability of the suggested MADM technique to completely present the decision data, enhance the accuracy of decision outcomes and prevent information loss

    Scoped and typed staging by evaluation

    Get PDF
    Using a dependently typed host language, we give a well scoped-and-typed by construction presentation of a minimal two level simply typed calculus with a static and a dynamic stage. The staging function partially evaluating the parts of a term that are static is obtained by a model construction inspired by normalisation by evaluation. We then go on to demonstrate how this minimal language can be extended to provide additional metaprogramming capabilities, and to define a higher order functional language evaluating to digital circuit descriptions

    Cyclic proof systems for modal fixpoint logics

    Get PDF
    This thesis is about cyclic and ill-founded proof systems for modal fixpoint logics, with and without explicit fixpoint quantifiers.Cyclic and ill-founded proof-theory allow proofs with infinite branches or paths, as long as they satisfy some correctness conditions ensuring the validity of the conclusion. In this dissertation we design a few cyclic and ill-founded systems: a cyclic one for the weak Grzegorczyk modal logic K4Grz, based on our explanation of the phenomenon of cyclic companionship; and ill-founded and cyclic ones for the full computation tree logic CTL* and the intuitionistic linear-time temporal logic iLTL. All systems are cut-free, and the cyclic ones for K4Grz and iLTL have fully finitary correctness conditions.Lastly, we use a cyclic system for the modal mu-calculus to obtain a proof of the uniform interpolation property for the logic which differs from the original, automata-based one

    Organizing sustainable development

    Get PDF
    The role and meaning of sustainable development have been recognized in the scientific literature for decades. However, there has recently been a dynamic increase in interest in the subject, which results in numerous, in-depth scientific research and publications with an interdisciplinary dimension. This edited volume is a compendium of theoretical knowledge on sustainable development. The context analysed in the publication includes a multi-level and multi-aspect analysis starting from the historical and legal conditions, through elements of the macro level and the micro level, inside the organization. Organizing Sustainable Development offers a systematic and comprehensive theoretical analysis of sustainable development supplemented with practical examples, which will allow obtaining comprehensive knowledge about the meaning and its multi-context application in practice. It shows the latest state of knowledge on the topic and will be of interest to students at an advanced level, academics and reflective practitioners in the fields of sustainable development, management studies, organizational studies and corporate social responsibility

    Logical disagreement : an epistemological study

    Get PDF
    While the epistemic significance of disagreement has been a popular topic in epistemology for at least a decade, little attention has been paid to logical disagreement. This monograph is meant as a remedy. The text starts with an extensive literature review of the epistemology of (peer) disagreement and sets the stage for an epistemological study of logical disagreement. The guiding thread for the rest of the work is then three distinct readings of the ambiguous term ‘logical disagreement’. Chapters 1 and 2 focus on the Ad Hoc Reading according to which logical disagreements occur when two subjects take incompatible doxastic attitudes toward a specific proposition in or about logic. Chapter 2 presents a new counterexample to the widely discussed Uniqueness Thesis. Chapters 3 and 4 focus on the Theory Choice Reading of ‘logical disagreement’. According to this interpretation, logical disagreements occur at the level of entire logical theories rather than individual entailment-claims. Chapter 4 concerns a key question from the philosophy of logic, viz., how we have epistemic justification for claims about logical consequence. In Chapters 5 and 6 we turn to the Akrasia Reading. On this reading, logical disagreements occur when there is a mismatch between the deductive strength of one’s background logic and the logical theory one prefers (officially). Chapter 6 introduces logical akrasia by analogy to epistemic akrasia and presents a novel dilemma. Chapter 7 revisits the epistemology of peer disagreement and argues that the epistemic significance of central principles from the literature are at best deflated in the context of logical disagreement. The chapter also develops a simple formal model of deep disagreement in Default Logic, relating this to our general discussion of logical disagreement. The monograph ends in an epilogue with some reflections on the potential epistemic significance of convergence in logical theorizing

    Fragments and frame classes:Towards a uniform proof theory for modal fixed point logics

    Get PDF
    This thesis studies the proof theory of modal fixed point logics. In particular, we construct proof systems for various fragments of the modal mu-calculus, interpreted over various classes of frames. With an emphasis on uniform constructions and general results, we aim to bring the relatively underdeveloped proof theory of modal fixed point logics closer to the well-established proof theory of basic modal logic. We employ two main approaches. First, we seek to generalise existing methods for basic modal logic to accommodate fragments of the modal mu-calculus. We use this approach for obtaining Hilbert-style proof systems. Secondly, we adapt existing proof systems for the modal mu-calculus to various classes of frames. This approach yields proof systems which are non-well-founded, or cyclic.The thesis starts with an introduction and some mathematical preliminaries. In Chapter 3 we give hypersequent calculi for modal logic with the master modality, building on work by Ori Lahav. This is followed by an Intermezzo, where we present an abstract framework for cyclic proofs, in which we give sufficient conditions for establishing the bounded proof property. In Chapter 4 we generalise existing work on Hilbert-style proof systems for PDL to the level of the continuous modal mu-calculus. Chapter 5 contains a novel cyclic proof system for the alternation-free two-way modal mu-calculus. Finally, in Chapter 6, we present a cyclic proof system for Guarded Kleene Algebra with Tests and take a first step towards using it to establish the completeness of an algebraic counterpart

    What is the aim of (contradictory) Christology?

    Get PDF
    [NOTE: The published version has some formatting errors, specifically with respect to block quotes. Please cite the published version, but if you are confused, consult the correctly formatted version on PhilArchive] How good a theory is depends on how well it meets the goals of its inquiry.  Thus, for example, theories in the natural sciences are better if in addition to stating truths, they also impart a kind of understanding.  Recent proposals—such as Jc Beall’s Contradictory Christology—to set Christian theology within non-classical logic  should be judged in a like manner:  according to how well they meet the goals of Christology.  This paper examines some of the effects of changing the logic of Christology on meeting the proposed goals of that inquiry.  The paraconsistent logic Beall favors has (FDE) features that inhibit increasing our understanding of the Incarnation.  Of course, there is good reason to think understanding is not the goal of Christological inquiry, that its goals are (for lack of a better word) devotional.  But FDE’s features don’t foster these goals either—raising questions about how much of a theological advance proposals like Beall’s could be

    Life settlement pricing with fuzzy parameters

    Full text link
    Existing literature asserts that the growth of life settlement (LS) markets, where they exist, is hampered by limited policyholder participation and suggests that to foster this growth appropriate pricing of LS transactions is crucial. The pricing of LSs relies on quantifying two key variables: the insured's mortality multiplier and the internal rate of return (IRR). However, the available information on these parameters is often scarce and vague. To address this issue, this article proposes a novel framework that models these variables using triangular fuzzy numbers (TFNs). This modelling approach aligns with how mortality multiplier and IRR data are typically provided in insurance markets and has the advantage of offering a natural interpretation for practitioners. When both the mortality multiplier and the IRR are represented as TFNs, the resulting LS price becomes a FN that no longer retains the triangular shape. Therefore, the paper introduces three alternative triangular approximations to simplify computations and enhance interpretation of the price. Additionally, six criteria are proposed to evaluate the effectiveness of each approximation method. These criteria go beyond the typical approach of assessing the approximation quality to the FN itself. They also consider the usability and comprehensibility for financial analysts with no prior knowledge of FNs. In summary, the framework presented in this paper represents a significant advancement in LS pricing. By incorporating TFNs, offering several triangular approximations and proposing goodness criteria of them, it addresses the challenges posed by limited and vague data, while also considering the practical needs of industry practitioners
    corecore