41,304 research outputs found

    Theory Morphisms in Church's Type Theory with Quotation and Evaluation

    Full text link
    CTTqe{\rm CTT}_{\rm qe} is a version of Church's type theory with global quotation and evaluation operators that is engineered to reason about the interplay of syntax and semantics and to formalize syntax-based mathematical algorithms. CTTuqe{\rm CTT}_{\rm uqe} is a variant of CTTqe{\rm CTT}_{\rm qe} that admits undefined expressions, partial functions, and multiple base types of individuals. It is better suited than CTTqe{\rm CTT}_{\rm qe} as a logic for building networks of theories connected by theory morphisms. This paper presents the syntax and semantics of CTTuqe{\rm CTT}_{\rm uqe}, defines a notion of a theory morphism from one CTTuqe{\rm CTT}_{\rm uqe} theory to another, and gives two simple examples that illustrate the use of theory morphisms in CTTuqe{\rm CTT}_{\rm uqe}.Comment: 17 page

    Research as a Learning Experience: Investigating Media Influence on Voters’ Opinions

    Get PDF

    Formalizing Mathematical Knowledge as a Biform Theory Graph: A Case Study

    Full text link
    A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory graph is a network of theories connected by meaning-preserving theory morphisms that map the formulas of one theory to the formulas of another theory. Theory graphs are in turn well suited for formalizing mathematical knowledge at the most convenient level of abstraction using the most convenient vocabulary. We are interested in the problem of whether a body of mathematical knowledge can be effectively formalized as a theory graph of biform theories. As a test case, we look at the graph of theories encoding natural number arithmetic. We used two different formalisms to do this, which we describe and compare. The first is realized in CTTuqe{\rm CTT}_{\rm uqe}, a version of Church's type theory with quotation and evaluation, and the second is realized in Agda, a dependently typed programming language.Comment: 43 pages; published without appendices in: H. Geuvers et al., eds, Intelligent Computer Mathematics (CICM 2017), Lecture Notes in Computer Science, Vol. 10383, pp. 9-24, Springer, 201

    Book review: Crime: The Mystery of the Common Sense Concept

    Get PDF
    Crime: The Mystery of the Common Sense Concept Reiner Robert , Crime: The Mystery of the Common Sense Concept, Polity: Cambridge, 2016; 272 pp.: 9780745660301, ÂŁ50.00 (hbk)

    Practicing Islam in Dijon, France: Interviews with Muslim Residents

    Get PDF

    "Practical, but nonetheless principled"? MacAngus and Kane

    Get PDF
    • 

    corecore