NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 5
  • 5
  • 5
  • 5
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 5 of 5 (0.108 seconds)

Spelling suggestions: "subject:"equivalence relations (tet theory)"" "subject:"equivalence relations (beet theory)""

1

Recursively enumerable equivalence relations

Carroll, Jeffrey Steven. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1984. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 82-83).
Equivalence relations (Set theory)
2

A text editor based on relations /

Fayerman, Brenda. January 1984 (has links)
No description available.
Text editors (Computer programs)
Equivalence relations (Set theory)
Algorithms.
3

A text editor based on relations /

Fayerman, Brenda. January 1984 (has links)
No description available.
Text editors (Computer programs)
Algorithms.
Equivalence relations (Set theory)
4

Partition Properties for Non-Ordinal Sets under the Axiom of Determinacy

Holshouser, Jared 05 1900 (has links)
In this paper we explore coloring theorems for the reals, its quotients, cardinals, and their combinations. This work is done under the scope of the axiom of determinacy. We also explore generalizations of Mycielski's theorem and show how these can be used to establish coloring theorems. To finish, we discuss the strange realm of long unions.
Determinacy
Infinite Combinatorics
Mathematics
Equivalence relations (Set theory)
Combinatorial analysis.
Partitions (Mathematics)
5

Automatically presentable structures

Ras, Charl John 03 September 2012 (has links)
M.Sc. / In this thesis we study some of the propertie of a clas called automatic structures. Automatic structures are structures that can be encoded (in some defined way) into a set of regular languages. This encoding allows one to prove many interesting properties about automatic structures, including decidabilty results.
Sequential machine theory
Automata
Formal languages
Equivalence relations (Set theory)
Permutation groups
Graph theory
Numbers, Natural
Logic, Symbolic and mathematical

Page generated in 0.1111 seconds