Logical syntax

Results: 623



#Item
1Truth in Mathematics: The Question of Pluralism∗ Peter Koellner “. . . before us lies the boundless ocean of unlimited possibilities.” —Carnap, The Logical Syntax of Language

Truth in Mathematics: The Question of Pluralism∗ Peter Koellner “. . . before us lies the boundless ocean of unlimited possibilities.” —Carnap, The Logical Syntax of Language

Add to Reading List

Source URL: logic.harvard.edu

Language: English - Date: 2011-09-24 11:49:33
    2REDO  Redesigning Logical Syntax Action de Recherche Collaborative 2009 INRIA Saclay - Île-de-France

    REDO Redesigning Logical Syntax Action de Recherche Collaborative 2009 INRIA Saclay - Île-de-France

    Add to Reading List

    Source URL: www.lix.polytechnique.fr

    - Date: 2009-09-30 09:10:45
      3REDO — Redesigning Logical Syntax • What is it about ? Proofs are everywhere! — We are trying to improve them. • What is the problem ? Remove bureaucracy but keep the computational content.

      REDO — Redesigning Logical Syntax • What is it about ? Proofs are everywhere! — We are trying to improve them. • What is the problem ? Remove bureaucracy but keep the computational content.

      Add to Reading List

      Source URL: www.lix.polytechnique.fr

      - Date: 2009-09-30 09:10:43
        4Expressive Logical Combinators for Free Pierre Genevès (CNRS) Joint work with Alan Schmitt (Inria) IJCAI, July 30th 2015, Buenos Aires

        Expressive Logical Combinators for Free Pierre Genevès (CNRS) Joint work with Alan Schmitt (Inria) IJCAI, July 30th 2015, Buenos Aires

        Add to Reading List

        Source URL: tyrex.inria.fr

        Language: English - Date: 2015-07-29 15:55:34
        5Crafting a Proof Assistant Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, and Stefano Zacchiroli Department of Computer Science, University of Bologna Mura Anteo Zamboni, 7 – 40127 Bologna, ITALY {asperti,sacerd

        Crafting a Proof Assistant Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, and Stefano Zacchiroli Department of Computer Science, University of Bologna Mura Anteo Zamboni, 7 – 40127 Bologna, ITALY {asperti,sacerd

        Add to Reading List

        Source URL: matita.cs.unibo.it

        Language: English - Date: 2007-05-25 11:04:16
        6predicate logic logical verification week

        predicate logic logical verification week

        Add to Reading List

        Source URL: www.cs.ru.nl

        Language: English - Date: 2004-12-15 12:39:18
        7

        Rudolf Carnap FILOZOFIA I SKŁADNIA LOGICZNA Fragment książki pt. Philosophy and Logical Syntax London 1935 Cz. I. Odrzucenie metafizyki

        Add to Reading List

        Source URL: filozofiauw.wdfiles.com

        Language: Polish - Date: 2012-09-17 04:01:20
          8Encoding Intonational Information in a Logical Grammar Chris Worth (Ohio State University) The discrepancy between syntactic structure and intonational structure is well known. This makes it particularly difficult to sim

          Encoding Intonational Information in a Logical Grammar Chris Worth (Ohio State University) The discrepancy between syntactic structure and intonational structure is well known. This makes it particularly difficult to sim

          Add to Reading List

          Source URL: www.ling.ohio-state.edu

          Language: English - Date: 2011-10-17 16:59:48
          9Generating Quantifiers and Negation to Explain Homework Testing  Jason Perry and Chung-chieh Shan Rutgers University Department of Computer Science

          Generating Quantifiers and Negation to Explain Homework Testing Jason Perry and Chung-chieh Shan Rutgers University Department of Computer Science

          Add to Reading List

          Source URL: paul.rutgers.edu

          Language: English - Date: 2012-03-01 10:11:23
          10logical verificationexercises 2 Exercise 1. This exercise is concerned with dependent types. We use the following definition in Coq: Inductive natlist_dep : nat -> Set := | nil_dep : natlist_dep 0

          logical verificationexercises 2 Exercise 1. This exercise is concerned with dependent types. We use the following definition in Coq: Inductive natlist_dep : nat -> Set := | nil_dep : natlist_dep 0

          Add to Reading List

          Source URL: www.cs.ru.nl

          Language: English - Date: 2011-09-02 08:06:23