Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Equivalence Relations of Non-Deterministic Ianov-Schemes
View through CrossRef
We consider three different meanings of a non-deterministic Ianov-scheme with respect to infinite computations: trace-semantics, Plotkin-semantics, and Smyth-semantics. The corresponding equivalence relations are shown to be decidable.
Title: Equivalence Relations of Non-Deterministic Ianov-Schemes
Description:
We consider three different meanings of a non-deterministic Ianov-scheme with respect to infinite computations: trace-semantics, Plotkin-semantics, and Smyth-semantics.
The corresponding equivalence relations are shown to be decidable.
Related Results
Translation Equivalence in Horror Movie
Translation Equivalence in Horror Movie
This study aims to analyze how subtitling in Pamali: The Corpse Village preserves elements of fear and cultural meaning through various types of equivalence and pragmatic strategie...
Likvärdighet i idrott och hälsa?
Likvärdighet i idrott och hälsa?
This thesis is about equivalence in the school subject of sports and health. More precisely, the purpose of this thesis is to contribute with new knowledge on how equivalence in sp...
Accuracy, Precision, And Agreement Statistical Tests For Bland-Altman Method
Accuracy, Precision, And Agreement Statistical Tests For Bland-Altman Method
Abstract
Background: Bland and Altman plot method is a widely cited graphical approach to assess equivalence of quantitative measurement techniques. Perhaps due to its grap...
Bi-Borel reducibility of essentially countable Borel equivalence relations
Bi-Borel reducibility of essentially countable Borel equivalence relations
This note answers a questions from [2] by showing that considered up to Borel reducibility, there are more essentially countable Borel equivalence relations than countable Borel eq...
Classifying positive equivalence relations
Classifying positive equivalence relations
AbstractGiven two (positive) equivalence relations ~1, ~2 on the set ω of natural numbers, we say that ~1 is m-reducible to ~2 if there exists a total recursive function h such tha...
A Study on Functional Equivalence in Translation of Lyric Prose — A Case of Autumn in Peiping by Zhang Peiji
A Study on Functional Equivalence in Translation of Lyric Prose — A Case of Autumn in Peiping by Zhang Peiji
The Functional Equivalence Theory put forward by Eugene Nida, an American translation theorist, notes that translation is a process of using the closest and most natural equivalent...
A Higher Algebraic K-Theory of Causality
A Higher Algebraic K-Theory of Causality
Causal discovery involves searching intractably large spaces. Decomposing the search space into classes of observationally equivalent causal models is a well-studied avenue to maki...