Characterizing NC with tier 0 pointers

Mathematical Logic Quarterly 50 (1):9 (2004)
  Copy   BIBTEX

Abstract

A two-sorted term system characterizing NC implicitly is described. The term system is defined over the tree algebra [MATHEMATICAL DOUBLE-STRUCK CAPITAL T], the free algebra generated by 0, 1 and ∗, and the recursion scheme uses pointers over tier 0. This differs from previous characterizations of NC, where tier 1 pointers were used or full parameter substitution over tier 0 was allowed

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.200310070

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,813

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Characterizing PSPACE with pointers.Isabel Oitavem - 2008 - Mathematical Logic Quarterly 54 (3):323-329.
Deictic codes for embodied language.Arthur M. Glenberg - 1997 - Behavioral and Brain Sciences 20 (4):749-749.
Hierarchies of modal and temporal logics with reference pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
Pointers, codes, and embodiment.Robert A. Wilson - 1997 - Behavioral and Brain Sciences 20 (4):757-758.
Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
Cellularity of Pseudo-Tree Algebras.Jennifer Brown - 2006 - Notre Dame Journal of Formal Logic 47 (3):353-359.
Pointing with focussing devices.Wolfram Schultz - 1997 - Behavioral and Brain Sciences 20 (4):755-756.
Evidence from the Past, Pointers to the Present: Towards an Evidence‐Based Approach to Evangelisation With Bernard Lonergan.Peter Corbishley - 2013 - Heythrop Journal 54 (5):825-834.
A blend of methods of recursion theory and topology: A Π1 0 tree of shadow points. [REVIEW]Iraj Kalantari & Larry Welch - 2004 - Archive for Mathematical Logic 43 (8):991-1008.
Pointers toward a dialogic?Adrian Peperzak - 1976 - Man and World 9 (4):372-392.
Intention, Emotion, and Action: A Neural Theory Based on Semantic Pointers.Tobias Schröder, Terrence C. Stewart & Paul Thagard - 2014 - Cognitive Science 38 (5):851-880.
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
Pointers on Pierre Bourdieu and Democratic Politics.Loic Wacquant - 2004 - Constellations 11 (1):3-15.
Quantifier elimination for infinite terms.G. Marongiu & S. Tulipani - 1991 - Archive for Mathematical Logic 31 (1):1-17.

Analytics

Added to PP
2013-12-01

Downloads
9 (#1,274,987)

6 months
1 (#1,507,095)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Characterizing PSPACE with pointers.Isabel Oitavem - 2008 - Mathematical Logic Quarterly 54 (3):323-329.
A recursion-theoretic approach to NP.Isabel Oitavem - 2011 - Annals of Pure and Applied Logic 162 (8):661-666.

Add more citations

References found in this work

No references found.

Add more references