Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Fixed Points Theorems for Non-Transitive Relations

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2022
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030187863146500
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5550
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2022
publishDateSort 2022
record_format rss_article
spellingShingle Fixed Points Theorems for Non-Transitive Relations
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Fixed Points Theorems for Non-Transitive Relations
title_auth Fixed Points Theorems for Non-Transitive Relations
title_full Fixed Points Theorems for Non-Transitive Relations
title_fullStr Fixed Points Theorems for Non-Transitive Relations
title_full_unstemmed Fixed Points Theorems for Non-Transitive Relations
title_short Fixed Points Theorems for Non-Transitive Relations
title_sort fixed points theorems for non-transitive relations
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.46298/lmcs-18(1:30)2022