Term logic

Results: 276



#Item
1Efficient Bijective Gödel Numberings for Term Algebras Paul Tarau1 1 Department of Computer Science and Engineering

Efficient Bijective Gödel Numberings for Term Algebras Paul Tarau1 1 Department of Computer Science and Engineering

Add to Reading List

Source URL: logic.cse.unt.edu

- Date: 2010-05-18 10:11:53
    2On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990

    On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990

    Add to Reading List

    Source URL: folk.uio.no

    Language: English - Date: 2014-04-01 05:47:01
    3Supplementary for Structural-RNN: Deep Learning on Spatio-Temporal Graphs Ashesh Jain1,2 , Amir R. Zamir1 , Silvio Savarese1 , and Ashutosh Saxena3 Stanford University1 , Cornell University2 , Brain Of Things Inc.3 {ashe

    Supplementary for Structural-RNN: Deep Learning on Spatio-Temporal Graphs Ashesh Jain1,2 , Amir R. Zamir1 , Silvio Savarese1 , and Ashutosh Saxena3 Stanford University1 , Cornell University2 , Brain Of Things Inc.3 {ashe

    Add to Reading List

    Source URL: cvgl.stanford.edu

    Language: English - Date: 2016-04-30 19:02:32
    4Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la

    Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la

    Add to Reading List

    Source URL: www.cs.ru.nl

    Language: English - Date: 2011-01-18 05:58:42
    5From notation to semantics: there and back again Luca Padovani1 and Stefano Zacchiroli2 1 Information Science and Technology Institute, University of Urbino

    From notation to semantics: there and back again Luca Padovani1 and Stefano Zacchiroli2 1 Information Science and Technology Institute, University of Urbino

    Add to Reading List

    Source URL: matita.cs.unibo.it

    Language: English - Date: 2007-05-28 05:00:45
    6Chapter 2 Untyped Lambda Calculus We assume the existence of a denumerable set VAR of (object) variables x0 , x1 , x2 , . . ., and use x, y, z to range over these variables. Given two variables x1 and x2 , we write x1 =

    Chapter 2 Untyped Lambda Calculus We assume the existence of a denumerable set VAR of (object) variables x0 , x1 , x2 , . . ., and use x, y, z to range over these variables. Given two variables x1 and x2 , we write x1 =

    Add to Reading List

    Source URL: www.cs.bu.edu

    Language: English - Date: 2009-12-10 13:51:51
    7No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositional

    No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositional

    Add to Reading List

    Source URL: www.lix.polytechnique.fr

    Language: English - Date: 2015-03-23 07:14:32
    8Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs ∗ J¨urgen Giesl Thomas Str¨oder

    Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs ∗ J¨urgen Giesl Thomas Str¨oder

    Add to Reading List

    Source URL: www.dcs.bbk.ac.uk

    Language: English - Date: 2012-07-18 09:07:52
    9Boolean Logic Introduction The basic Boolean operators are AND, OR and NOT. Use these operators to combine terms when searching in electronic databases and search engines. Some databases and search engines also support t

    Boolean Logic Introduction The basic Boolean operators are AND, OR and NOT. Use these operators to combine terms when searching in electronic databases and search engines. Some databases and search engines also support t

    Add to Reading List

    Source URL: pod.nku.edu

    Language: English - Date: 2007-01-10 12:31:35
    10Specialising the Ground Representation in the Logic Programming Language G¨odel. C.A.Gurr∗ University of Edinburgh Abstract

    Specialising the Ground Representation in the Logic Programming Language G¨odel. C.A.Gurr∗ University of Edinburgh Abstract

    Add to Reading List

    Source URL: repository.readscheme.org

    Language: English - Date: 2010-10-22 08:05:11