Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • FORMAL REPRESENTATIONS OF DEPENDENCE AND GROUNDEDNESS

  • EDOARDO RIVELLO
  • Journal:
    The Review of Symbolic Logic / Volume 13 / Issue 1 / March 2020
    Published online by Cambridge University Press:
    16 July 2019, pp. 105-140
    Print publication:
    March 2020

  • We study, in an abstract and general framework, formal representations of dependence and groundedness which occur in semantic theories of truth. Our goals are (a) to relate the different ways in which groundedness is defined according to the way dependence is represented and (b) to represent different notions of dependence as instances of a suitable generalisation of the mathematical notion of functional dependence.

  • LIPSCHITZ MAPS ON TREES

  • Stevo Todorcevic
  • Journal:
    Journal of the Institute of Mathematics of Jussieu / Volume 6 / Issue 3 / July 2007
    Published online by Cambridge University Press:
    04 December 2006, pp. 527-556
    Print publication:
    July 2007

  • We introduce and study a metric notion for trees and develop a fine structure theory for the corresponding class of Lipschitz trees. We also relate this structure theory to a conjecture of Shelah about the existence of a finite basis for a class of linear orderings and solve an old problem of Laver about well-quasi-ordering a certain class of trees.