The difference poset of monotone functions

&
Foundations of Physics 24:1325-1346 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

  • This entry has no external links. Add one.
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

On poset Boolean algebras of scattered posets with finite width.Robert Bonnet & Matatyahu Rubin - 2004 - Archive for Mathematical Logic 43 (4):467-476.
Filters on Computable Posets.Steffen Lempp & Carl Mummert - 2006 - Notre Dame Journal of Formal Logic 47 (4):479-485.
Cardinal invariants of monotone and porous sets.Michael Hrušák & Ondřej Zindulka - 2012 - Journal of Symbolic Logic 77 (1):159-173.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Proofs with monotone cuts.Emil Jeřábek - 2012 - Mathematical Logic Quarterly 58 (3):177-187.
Monotone inductive definitions in a constructive theory of functions and classes.Shuzo Takahashi - 1989 - Annals of Pure and Applied Logic 42 (3):255-297.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Antichains in partially ordered sets of singular cofinality.Assaf Rinot - 2007 - Archive for Mathematical Logic 46 (5-6):457-464.
Lower Bounds for resolution and cutting plane proofs and monotone computations.Pavel Pudlák - 1997 - Journal of Symbolic Logic 62 (3):981-998.
Light monotone Dialectica methods for proof mining.Mircea-Dan Hernest - 2009 - Mathematical Logic Quarterly 55 (5):551-561.
Monotone majorizable functionals.Helmut Schwichtenberg - 1999 - Studia Logica 62 (2):283-289.
Subrecursive functions on partial sequences.Karl-Heinz Niggl - 1999 - Archive for Mathematical Logic 38 (3):163-193.
Plain semi-post algebras as a poset-based generalization of post algebras and their representability.Nguyen Cat Ho & Helena Rasiowa - 1989 - Studia Logica 48 (4):509 - 530.
A decision procedure for monotone functions over bounded and complete lattices.Domenico Cantone & Calogero G. Zarba - 2006 - In Harrie de Swart, Ewa Orlowska, Gunther Smith & Marc Roubens (eds.), Theory and Applications of Relational Structures as Knowledge Instruments Ii. Springer. pp. 318--333.
that B is Turing reducible to A and write B≤ T A. We say that B≡ T A if B≤ T A and A≤ T B.≡ T is an equivalence relation, and≤ T induces a par-tial ordering on the corresponding equivalence classes; the poset obtained in this way is called the degrees of unsolvability, and elements of this poset are called degrees. [REVIEW]J. Knight, A. Kucera & R. Shore - 1995 - Bulletin of Symbolic Logic 1 (2).

Analytics

Added to PP
2014-04-03

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references