Finite preorders and Topological descent I

By George Janelidze, M. Sobral. 2002

50 citations recorded by the source corpus.

Abstract It is shown that the descent constructions of finite preorders provide a simple motivation for those of topological spaces, and new counter-examples to open problems in Topological descent theory are constructed.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/93707ce2673b59c5fcdac0206cd2f6b08431eb68

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Jonathan Ariel Barmak

In Computer Vision and Pattern Recognition

  1. Jonathan Ariel Barmak

In Mathematical Physics

  1. Jonathan Ariel Barmak

Citations in the corpus