Search

This article contains a descriptive survey on the acceptability of equivalence-based translation of the menu of TECNO Android phones into the Yorùbá language, one of the three major languages in Nigeria. Words translated into Yorùbá were categorized into strategies of borrowing, semantic extension and composition and analysed from equivalence effect. In the follow-up survey, information and communication technology experts and general mobile phone users were carefully chosen and consulted for an assessment of the appropriateness of the translation. The study concluded that equivalence, the key term of linguistic translation theories, is still a viable concept in the translation of information and communication technology and equivalence-based translation into Yorùbá will not only promote the language but also contribute to effective communication in a multilingual global village that the world is fast becoming.

The thesis abstract, as a genre has a set of communicative functions mutually-understood by established members of the academic community. A vast majority of translation studies of source language (SL) and target language (TL) equivalence seems to have overlooked the inherent relationship between form and function when translating. The purpose of this study was to find out whether the Arab students would translate the English passive structures into their corresponding Arabic passive in order to maintain the pragma-generic functions associated with these constructions or would employ other translation replacements when translating English passives into Arabic. A further purpose was to find out what grammatical factors constrain the choice of these translation options. To fulfill these purposes, we investigated the voice choice in 90 MA thesis abstracts and their 90 Arabic translated versions written in English by the same MA students, drawn from the field of Linguistics. The data analysis revealed that when the Arab student-translators come across the English passive sentence, they resort to either of the following options: Transposing English passives into verbal nouns (masdar), or into pseudo-active verbs or active sentence structures, or into vowel melody passives, or omitting these passive structures.

This paper reports on patterns of verb choice in identifying relational clauses (e.g. ‘X is Y, Y is X’) in English technical manuals. While it is obvious that specific lexical verbs will feature in identifying clauses of different functions, e.g. mean (defining), call (naming), exemplify (exemplifying), less transparent is the distribution of these more specific verbs and the general or neutral verb be. The findings suggest that verb choice in (technical) identifying clauses is strongly associated with the degree of equivalence constructed between the two central nominal groups in the clause (the Token and Value). Equivalence relations are one-to-one (rather than one-to-many) and exhaustive (rather than semantically open). Major grammatical influences on equivalence include nominal group structure, ergativity of the clause, and the inclusion of features (e.g. interpersonal, logical or textual) that undermine the privileging of an experientially homogeneous world-view. The results challenge the notions that be and specific verbs are interchangeable and that be is an unmarked choice. On the contrary, the data reveal that under certain conditions be is the more marked choice. The results have practical implications for teachers and students of English (in particular, students of English for Academic and/or Specific Purposes) as well as translators.

Jean-Claude Izzo, an author committed to reality, recreates in his work Le Soleil des mourants the life of an indigent condemned to exclusion and loneliness. His critique also extends to contemporary society, both urban and dehumanized, and to the institutions and organisms that govern it, incapable of coping with social stigmas. This paper aims to disentangle, through a semantic-stylistic analysis, the homeless figure who stands as the cornerstone around which the story revolves. This paper also tries to identify the textual, linguistic, and cultural singularities that, from a translation studies approach, are regarded as specific translation challenges in this novel. This study puts forth a proposal for the Spanish translation of a selection of passages that support our arguments. The translation decisions are made according to the concept of communicative equivalence (Wotjak 2015) and to the taxonomy of techniques compiled by Hurtado Albir (2008, 269–271). The paper concludes that the concept of communicative equivalence has become a relevant methodology for the translation of Le Soleil des mourants, as it enables the translator to render the denotative elements of the message, the connotative and expressive use of the language, and the author’s communicative intention.

Translation is a language activity that involves intercultural activities. The study’s focus is on subtitling as a didactic tool for relating exactness of information and cultural preservation: The Igbo language Mediascape example, by looking at the correctness of the subtitled expressions in context, in the movie used for the study. Language is a human form of communication in his sociocultural environment as well as culture which is people's way of life. The study adopted the frameworks of Gotlieb's strategy and Nida's equivalence to tackle the study’s problems. It also adopted the methodology of description and emergent design approach in the study. For the correctness of the source information expressions in context, it is discovered that by the use of Gotlieb's strategy and Nida's translation equivalence, the study was able to transfer right messages in the context in which they are used. It is discovered that the research objective of the study is achieved thereby attaining the signification of the study.

This article examines a question of the interest of scholars dealing with phraseology, terminology and translation, namely the task of translating and finding equivalents of idiomatic expressions, such as specialized phraseological units (henceforth SPUs), especially those in which a dead metaphor underlies. Among the unsolved questions that phraseology still struggles with to establish itself as a discipline on its own right there are two hindering factors that are related to terminology and translation: on the one hand, specialized phraseology is an under-explored and a not institutionalized line of research, to the point of being deemed a non-coherent research field (Kjær, 2007, p. 507). On the other hand, phraseology is considered to be a missing training subject in translation academic syllabi (Corpas Pastor, 2003, p. 222). Therefore, this study intends to offer descriptive data that could be used as a starting point for finding answers regarding the identification and even the creation of equivalents for SPUs that include dead metaphors among their lexical components. The aim of this article is two-fold, (i) it will offer a series of linguistic analyses (morphosyntactic and semantic) of the word forms in the SPUs being analyzed, and their equivalents and (ii) it will shed light on the translation techniques (Molina & Hurtado Albir, 2002, pp. 509-511) used to coin the equivalents of these SPUs.

A design point is inessential when it does not contribute to an optimal design, and can therefore be safely discarded from the design space. We derive three inequalities for the detection of such inessential points in c-optimal design: the first two are direct consequences of the equivalence theorem for c-optimality; the third one is derived from a second-order cone programming formulation of c-optimal design. Elimination rules for A-optimal design are obtained as a byproduct. When implemented within an optimization algorithm, each inequality gives a screening test that may provide a substantial acceleration by reducing the size of the problem online. Several examples are presented with a multiplicative algorithm to illustrate the effectiveness of the approach.

This article is concerned with my personal account of the process of translating into Vietnamese a world famous grammar book: An Introduction to Functional Grammar, Second Edition, written by world renowned scholar M. A. K. Halliday. The account of the translation process is placed within the compass of systemic functional linguistics. It is clear from my account that in translating An Introduction to Functional Grammar, Second Edition, the translator may experience many daunting problems, among which the problems of translating technical terms and long and heavily loaded nominal groups seem to be the toughest. It is also clear from my account that systemic functional linguistics is highly relevant to translation theory and translation practice. It can stand to benefit the translator from analysis of the source text, to discussion of translation problems, to explanation for establishment of points of equivalence between the choices in the target text and those in the source text, and to synthesis of the target text.

We fill a gap in the literature regarding `transport of structure' for (n+2)-angulated, n-exact, n-abelian and n-exangulated categories appearing in (classical and higher) homological algebra. As an application of our main results, we show that a skeleton of one of these kinds of categories inherits the same structure in a canonical way, up to equivalence. In particular, it follows that a skeleton of a weak (n+2)-angulated category is in fact what we call a strong (n+2)-angulated category. When n=1 this clarifies a technical concern with the definition of a cluster category. We also introduce the notion of an n-exangulated functor between n-exangulated categories. This recovers the definition of an (n+2)-angulated functor when the categories concerned are (n+2)-angulated, and the higher analogue of an exact functor when the categories concerned are n-exact., Comment: v3: 24 pages; minor typographical changes; accepted in Journal of Algebra

Streaming tree transducers with single-use restriction ( STT sur s ) were introduced by Alur and D'Antoni as an analyzable, executable, and expressive model for transforming unranked ordered trees in a single pass. The equivalence problem of STT sur s is decidable because their class is as expressive as the class of MSO-definable tree transformations. In this paper, we present streaming ranked-tree-to-string transducers (SRTSTs), based on STT sur s : SRTSTs are released from the single-use restriction while their input and output are restricted to ranked trees and strings, respectively. We show that the expressiveness of SRTSTs coincides with that of deterministic top-down tree transducers with regular look-ahead ( yDT R s ), whose equivalence problem is known to be decidable. Our proof is done by constructing equivalent transducers in both directions.

Formal criteria of theoretical equivalence are mathematical mappings between specific sorts of mathematical objects, notably including those objects used in mathematical physics. Proponents of formal criteria claim that results involving these criteria have implications that extend beyond pure mathematics. For instance, they claim that formal criteria bear on the project of using our best mathematical physics as a guide to what the world is like, and also have deflationary implications for various debates in the metaphysics of physics. In this paper, I investigate whether there is a defensible view according to which formal criteria have significant non-mathematical implications, of these sorts or any other, reaching a chiefly negative verdict. Along the way, I discuss various foundational issues concerning how we use mathematical objects to describe the world when doing physics, and how this practice should inform metaphysics. I diagnose the prominence of formal criteria as stemming from contentious views on these foundational issues, and endeavor to motivate some alternative views in their stead.

Google Translate (GT) is the most widely used translator application in the world. The function of GT is not merely as tools but has become a means in personal communication, learning and business matters. This paper aims to examine the GT accuracy in translating culinary texts. This paper used a semiotic approach to analyze the equivalence of GT from the source language to the target language. The data source as the object of study is French culinary texts retrieved from the internet. It can be concluded that the accuracy of GT in culinary texts lies in words, phrases and sentences. GT does not yet have good accuracy in translating culture between source and target languages. In the semiotic perspective, the GT translation model is the translation from the source language form to the target language form (signifier) by maintaining the concept (meaning). GT does not yet have a translation feature in a cultural context. The advancement in information technology shows that GT, as a human-robot, can replace human translators.

Apparently, during an informed consent, patients remember little of the information given and their comprehension level is often overestimated by physicians. This study measures level of understanding of informed consent for elective cesarean surgery using an evidence-based informed consent (EBIC) model based on six MERLO assessments. MERLO recognition and production scores and follow-up interviews of 50 patients and their partners were recorded. Statistical comparison of scores within couples was performed by weighted kappa agreement, t-tests, and Ward's hierarchical clustering. Recognition score means were high for patients and partners with low standard deviation (SD), while production scores means were lower with higher SD. Clustering analysis showed that only 70% (35/50) of couples were assigned to the same cluster and t-test yields significant difference of scores within couple. Kappa yields moderate agreement levels on all items except for items D and C, which are lower. Follow-up interviews show that participants consider MERLO assessments to be helpful in improving comprehension.

This paper aims to explore how translators translate both the connotative and denotative meanings of near-synonyms from the Quran into English language. The article will shed light on the phenomenon of near-synonymy, as well as its connotative and denotative meanings and how the translator’s background could have influenced their translation. There has been a dearth of attention on the translation of near-synonyms in the Quran; accordingly, this study examines three pairs of near-synonyms from the Quran and their particular translations in the following three English translations of the Quran itself : 1) The Koran Interpreted by Arberry; 2) The Quran: A New Translation by Abdel Haleem; and 3) The Sublime Quran by Bakhtiar. These translations were chosen due to the significant differences in style and translators’ backgrounds. The analysis aims to highlight the difference in meaning of each pair of near-synonyms by distinguishing both their connotative and denotative meanings. This will be followed by an examination of the translations to recognise whether the near-synonyms were accurately translated in these given instances or lost some, or even all, of their meaning during the translation process and discuss if translator’s background could have influence on it. Based on the discussion and analysis of these examples, it is evident that all three translations failed to distinguish between the pair of near-synonyms and to capture the accurate meaning throughout the Quran, leading to a semantic void. It is similarly clear that the linguistic complexity of the Holy Quran has created a challenging mission for translators, which has ultimately led to loss of accuracy and meaning. The results have shown that each translator chose their own approach based on their translational goal or their educational and personal backgrounds. Keywords: Quran; Near-Synonyms; Quran Translation; Connotative Meaning; Equivalence

Finitary Idealized Concurrent Algol (FICA) is a prototypical programming language combining functional, imperative, and concurrent computation. There exists a fully abstract game model of FICA, which in principle can be used to prove equivalence and safety of FICA programs. Unfortunately, the problems are undecidable for the whole language, and only very rudimentary decidable sub-languages are known. We propose leafy automata as a dedicated automata-theoretic formalism for representing the game semantics of FICA. The automata use an infinite alphabet with a tree structure. We show that the game semantics of any FICA term can be represented by traces of a leafy automaton. Conversely, the traces of any leafy automaton can be represented by a FICA term. Because of the close match with FICA, we view leafy automata as a promising starting point for finding decidable subclasses of the language and, more generally, to provide a new perspective on models of higher-order concurrent computation. Moreover, we identify a fragment of FICA that is amenable to verification by translation into a particular class of leafy automata. Using a locality property of the latter class, where communication between levels is restricted and every other level is bounded, we show that their emptiness problem is decidable by reduction to Petri net reachability., Comment: 18 pages plus appendices

Automata theory based on quantum logic has been established by Ying. Nondeterministic fuzzy finite automata theory has been proposed by Cao, and further generalized by Pan et al. In this paper, we propose the notion of nondeterministic finite automaton based on quantum logic whose underlying structure is a complete orthomodular lattice l, called nondeterministic l-valued finite automaton (Nl-FA, for short). We show that nondeterministic l-valued finite automata, deterministic l-valued finite automata, and nondeterministic l-valued finite automata with e-moves are equivalent if and only if l satisfies the distributive law. Next, two l-valued relations in terms of language equivalence are given. Some properties of the two l-valued relations under various operations such as reversal, union, product, and concatenation, are investigated. Finally, we give the degree of the closeness between two Nl-FAs with the same set of states to reflect the robustness, and obtain some interesting results. The theory developed in this paper enriches the automata theory based on quantum logic.

A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by S\'enizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata. The presented proof is conceptually simpler, and a particular novelty is that it is not given as two semidecision procedures but it provides an explicit algorithm that might be amenable to a complexity analysis., Comment: version accepted to JCSS

In this paper we prove that the category of finite quasigroupoids is equivalent to the one of pointed cosemisimple weak Hopf quasigroups over a given field K . As a consequence, if K is algebraically closed, we obtain that the categories of finite quasigroupoids and cocommutative cosemisimple weak Hopf quasigroups are equivalent. Moreover the restriction of the previous equivalence to the category of quasigroups (loops with the inverse property) provides a categorical equivalence between the categories of quasigroups and of pointed cosemisimple Hopf quasigroups over K and, as in the weak case, if K is algebraically closed, the category of quasigroups is equivalent to the one of cocommutative cosemisimple Hopf quasigroups.

The paper analyses Latvian and German somatic idioms in the dictionaries by K. Ulmann and K. Ulmann / G. Braže. Up to now the researchers of Latvian phraseology have not focused to analyse these theme – especially in diachronic aspect. The paper presents the most fixed somatic idioms in the Latvian and German and their equivalence types. The author compares with the meanings of idioms from the first dictionary (1638) to modern electronic dictionary “Modern Latvian dictionary”. KEY WORDS: the dictionaries by K. Ulmann and K. Ulmann / G. Braže, somatic idioms, somatic components, the equivalence types of German–Latvian somatic idioms. DOI: http://dx.doi.org/10.15181/rh.v19i0.1329

This paper provides the first contrastive analysis of a coherence relation (viz. addition) and its connectives across a sign language (French Belgian Sign Language) and a spoken language (French), both used in the same geographical area. The analysis examines the frequency and types of connectives that can express an additive relation, in order to contrast its “markedness” in the two languages, that is, whether addition is marked by dedicated connectives or by ambiguous, polyfunctional ones. Furthermore, we investigate the functions of the most frequent additive connective in each language (namely et and the sign SAME), starting from the observation that most connectives are highly polyfunctional. This analysis intends to show which functions are compatible with the meaning of addition in spoken and signed discourse. Despite a common core of shared discourse functions, the equivalence between et and SAME is only partial and relates to a difference in their semantics.

This paper aims to explain the concept of Tarkib Isnadi in Arabic grammar and describe the equivalent concept and its components in Indonesian grammar. In the realm of Arabic grammar, Tarkib Isnadi is a core component in the structure of clauses or sentences in Arabic. A good understanding of Tarkib Isnadi in Arabic and its equivalent in Indonesian will make it easier for Arabic learners (L2) who come from native Indonesian speakers (L1) to identify clause and sentence structures in various Arabic discourses. The methods used in data analysis in this study are distribution and identity-referential methods. Based on observations, it is found that the concept of Tarkib Isnadi in Arabic has a concept equivalent to a clause in Indonesian because both have the core constituents or pillars of the sentence. On the other hand, there are also some differences in the concept of Tarkib Isnadi in Arabic with the concept of clauses in Indonesian. The difference mainly lies in terms of the formation of the concept and the filling components of their syntactic functions.

El examen de los nombres con sentido locativo del español y del chino se prestan a un análisis contrastivo, que entre otros aspectos pone de manifiesto la complejidad y riqueza de los procesos morfológicos que intervienen en la formación léxica, y permiten observar las relaciones que se establecen entre los mecanismos más sistemáticos y productivos de ambos códigos. Se comprueba la equivalencia entre los núcleos nominales de la composición sintagmática del español con los formantes locativos del chino. Aunque, en español no parece darse un caso claro de gramaticalización semejante al que ha experimentado algún formante locativo del chino y, por otra parte, se argumenta que mientras algunos formantes del chino alcanzan cierta autonomía léxica en determinados contextos, otros se corresponden funcionalmente con los elementos sufijales del español.

This paper considers a class of mathematical programs that include multiobjective generalized Nash equilibrium problems in the constraints. Little research can be found in the literature although it has some interesting applications. We present a single level reformulation for this kind of problems and show their equivalence in terms of global and local minimizers. We find that the reformulation is a special case of the so-called mathematical program with equilibrium constraints which is extensively studied in the literature.

Language models trained on billions of tokens have recently led to unprecedented results on many NLP tasks. This success raises the question of whether, in principle, a system can ever “understand” raw text without access to some form of grounding. We formally investigate the abilities of ungrounded systems to acquire meaning. Our analysis focuses on the role of “assertions”: textual contexts that provide indirect clues about the underlying semantics. We study whether assertions enable a system to emulate representations preserving semantic relations like equivalence. We find that assertions enable semantic emulation of languages that satisfy a strong notion of semantic transparency. However, for classes of languages where the same expression can take different values in different contexts, we show that emulation can become uncomputable. Finally, we discuss differences between our formal model and natural language, exploring how our results generalize to a modal setting and other semantic relations. Together, our results suggest that assertions in code or language do not provide sufficient signal to fully emulate semantic representations. We formalize ways in which ungrounded language models appear to be fundamentally limited in their ability to “understand”.

This article is dedicated to analyze several peculiarities of newspaper headlines of various sources. The news headlines can be analyzed from different linguistic aspects. It is composed of introduction, theoretical and practical parts, conclusions and the list of references. The main part of the article deals with practical analysis of the stylistic features typical for the newspaper headlines. Conclusions give the findings and the results of the presented study. Newspaper headlines are written in precise, concise language. They should be easy to read and read without any obstacles, since newspapers are most often aimed at a broad audience. At the same time, the newspaper headline should be expressive enough to grab the reader's attention.

Happel constructed a fully faithful functor H : D b ( mod Λ ) → mod _ Z T ( Λ ) for a finite dimensional algebra Λ. He also showed that this functor H gives an equivalence precisely when gldim Λ ∞ . Thus if H gives an equivalence, then it provides a canonical tilting object H ( Λ ) of mod Z T ( Λ ) . In this paper we generalize the Happel functor H in the case where T ( Λ ) is replaced with a finitely graded IG-algebra A. We study when this functor is fully faithful or is an equivalence. For this purpose we introduce the notion of homologically well-graded (hwg) IG-algebra, which can be characterized as an algebra posses a homological symmetry which, a posteriori, guarantee that the algebra is IG. We prove that hwg IG-algebras is precisely the class of finitely graded IG-algebras that the Happel functor is fully faithful. We also identify the class that the Happel functor gives an equivalence. As a consequence of our result, we see that if H gives an equivalence, then it provides a canonical tilting object H ( T ) of CM _ Z A . For some special classes of finitely graded IG-algebras, our tilting objects H ( T ) coincide with tilting object constructed in previous works.

In this article the semantic structures of constructing American blog discourse are analyzed. Those structures are based upon semantic relations between propositions in the text of the blogs and aim to enhance coherence in this discourse. The results show that particular types of interpropositional relations are used on macro-semantic level for different subgenres of blogs (the semantic relations of equivalence, comparison, contrast, ‘part-whole’/’whole-part’, implication/causality, chronological order and spatial order relations). In particular, these interpropositional relations differ in the subgenres, such as political, business, socio-cultural, technology, and sports. In addition, the analysis brings out the different percentage of their usage.Manuscript received 23.04.2020

The human brain, which can be programmed through a multiplicity of practices, is the foundation of NLP. Language teachers can effectively program their students for improved language output if made aware of the Neuro-functioning of the brain. This new-fangled aspect of language teaching is, hitherto, an uncharted area in the Pakistani teaching context. The current study seeks to look into the existing estate of English language pedagogy in Pakistani scenario with the assistance of the NLP Milton Model, based on the employment of the language patterns by famous hypnotist-Milton Erickson. The focal point of this model is- presupposition, mind read, lost performative, unspecified verb, comparative deletion, cause and effect, universal quantifier, complex equivalence, modal operator, nominalization, and unspecified referential index. It has implications, to a great extent, in ELT to generate preferred results. For this study, the sample population is chosen through purposive sampling technique and encompasses language skills’ classes; whereas, the five English Language institutions were preferred through random sampling method. This study, accordingly, underpins the exploitation of NLP as a toolkit for effectual language pedagogy. Besides, it also advocates copious ways for meaningful, motivational, and momentous communication between language teachers and learners.

Nowadays, people can easily access everything with one-click away. For example, when you want to read an article in foreign language which you are not familiar with, then you just need to open Google Translate and within seconds, you will get the translation of it. To deal with that reality, a translator has to differentiate himself from machine translation which is increasingly used by the public. Therefore, the translator is required to produce an equivalent and natural translation in the Target Language. This research aims to provide understanding of translation equivalence on video transcripts conducted by students in Movie Translation (Subtitling) course. This study uses qualitative approach, content analysis method, and purposive sampling to collect data. In short, there are two types of translation equivalence used by students, formal and dynamic. Formal equivalence focuses on the similarity of the form and meaning of the message from Source Language to Target Language, while dynamic one focuses on the naturalness of expression in the Target Language.

Semantics is meaning communicated through language (Saeed I.J.). Semantics is the study of relationship between words and their meanings; it is directly linked with the conceptual meaning of words, and the associative meaning. Semantic sieve as a concept is an innovative phenomenon. This linguistic phenomenon is a process whereby a word is dispersed through a semantic tunnel which in some cases produces different meaning. This is explained through different models. The semantic sieve is related to translation, where the deep structure of words differs from the surface structure. There are some concepts and words in Akan and English that are absent in Russian, others are known in Akan but virtually absent in the English language.

Discourse theorists often defend their discursive stance on ‘reality’ and the material with reference to Laclau and Mouffe’s quote that, while an “earthquake or the falling of a brick…exist externally to thought,” they cannot “constitute themselves as objects outside any discursive conditions of emergence”. While fully endorsing this statement, we argue that it does not licence discourse theorists to consider discursive formations divorced from their material context, but obliges us to account for the constraints and affordances of the material conditions on the structuring of the discursive field itself. Drawing on previous work, we argue that material conditions may render discourse systems incommensurate, such that they cannot be articulated through chains of equivalence within a radically restructured field. We suggest as a way forward the concept of the nomadic politician continually traversing between equivalential systems in order to reconfigure and renegotiate key signifiers within the materially-constrained discursive fields of each.

We consider an object calculus in which open terms interact with the environment through interfaces. The calculus is intended to capture the essence of contextual interactions of Middleweight Java code. Using game semantics, we provide fully abstract models for the induced notions of contextual approximation and equivalence. These are the first denotational models of this kind.

Let V be an n-dimensional linear space over an algebraically closed base field. We provide a general method for classifying, up to equivalence, all bilinear maps f : V × V → V such that d i m ( r a...

This article deals with advanced notions of equivalence between nonmonotonic logic programs under the answer-set semantics, a topic of considerable interest, because such notions form the basis for program verification and are useful for program optimisation, debugging, and modular programming. In fact, there is extensive research in answer-set programming (ASP) dealing with different notions of equivalence between programs. Prominent among these notions is uniform equivalence , which checks whether two programs have the same semantics when joined with an arbitrary set of facts. In this article, we study a family of more fine-grained versions of uniform equivalence, viz. relativised uniform equivalence with projection , which extends standard uniform equivalence in terms of two additional parameters: one for specifying the input alphabet and one for specifying the output alphabet for programs. In particular, the second parameter is used for projecting answer sets to a set of designated output atoms. Answer-set projection, in particular, allows to compare programs that make use of different auxiliary atoms, which is important for practical programming aspects. We introduce novel semantic characterisations for the program correspondence problems under consideration and analyse their computational complexity. In the general case, deciding these problems lies on the third level of the polynomial hierarchy. Therefore, this task cannot be efficiently reduced to propositional answer-set programs itself (under the usual complexity-theoretic assumptions). However, reductions to quantified Boolean formulas (QBFs) are feasible. Indeed, we provide efficient (in fact, linear-time constructible) reductions to QBFs and discuss simplifications for certain special cases. These QBF reductions yield the basis for a prototype implementation, the system cc ⊤, for deciding correspondence problems by using off-the-shelf QBF solvers. We discuss an application of cc ⊤ for verifying the correctness of solutions by students drawn from a laboratory course on logic programming and knowledge representation at the Technische Universität Wien, employing relativised uniform equivalence with projection as the underlying program correspondence notion.

In this paper, we develop a technique which enables us to obtain several results from the theory of Γ-semigroups as logical implications of their semigroup theoretical analogues.

Reflex is a process-oriented language that provides a design of easy-to-maintain control software for programmable logic controllers. The language has been successfully used in a several reliability critical control systems, e. g. control software for a silicon single crystal growth furnace and electronic equipment control system. Currently, the main goal of the Reflex language project is to develop formal verification methods for Reflex programs in order to guarantee increased reliability of the software created on its basis. The paper presents the formal operational semantics of Reflex programs extended by annotations describing the formal specification of software requirements as a necessary basis for the application of such methods. A brief overview of the Reflex language is given and a simple example of its use – a control program for a hand dryer – is provided. The concepts of environment and variables shared with the environment are defined that allows to disengage from specific input/output ports. Types of annotations that specify restrictions on the values of the variables at program launch, restrictions on the environment (in particular, on the control object), invariants of the control cycle, pre- and postconditions of external functions used in Reflex programs are defined. Annotated Reflex also uses standard annotations assume, assert and havoc. The operational semantics of the annotated Reflex programs uses the global clock as well as the local clocks of separate processes, the time of which is measured in the number of iterations of the control cycle, to simulate time constraints on the execution of processes at certain states. It stores a complete history of changes of the values of shared variables for a more precise description of the time properties of the program and its environment. Semantics takes into account the infinity of the program execution cycle, the logic of process transition management from state to state and the interaction of processes with each other and with the environment. Extending the formal operational semantics of the Reflex language to annotations simplifies the proof of the correctness of the transformation approach to deductive verification of Reflex programs developed by the authors, transforming an annotated Reflex program to an annotated program in a very limited subset of the C language, by reducing a complex proof of preserving the truth of program requirements during the transformation to a simpler proof of equivalence of the original and the resulting annotated programs with respect to their operational semantics.

We obtain a weak homotopy equivalence type result between two topological groups associated with a Kirchberg algebra: the unitary group of the continuous asymptotic centralizer and the loop group of the automorphism group of the stabilization. This result plays a crucial role in our subsequent work on the classification of poly-$\mathbb{Z}$ group actions on Kirchberg algebras. As a special case, we show that the $K$-groups of the continuous asymptotic centralizer are isomorphic to the $KK$-groups of the Kirchberg algebra., 32 pages

Reachability analysis is a fundamental program analysis with a wide variety of applications. We present FlowCFL, a type-based reachability analysis that accounts for mutable heap data. The underlying semantics of FlowCFL is Context-Free-Language (CFL)-reachability. We make three contributions. First, we define a dynamic semantics that captures the notion of flow commonly used in reachability analysis. Second, we establish correctness of CFL-reachability over graphs with inverse edges (inverse edges are necessary for the handling of mutable heap data). Our approach combines CFL-reachability with reference immutability to avoid the addition of certain inverse edges, which results in graph reduction and precision improvement. The key contribution of our work is the formal account of correctness, which extends to the case when inverse edges are removed. Third, we present a type-based reachability analysis and establish equivalence between a certain CFL-reachability analysis and the type-based analysis, thus proving correctness of the type-based analysis.

We determine the possible functions that can occur, up to asymptotic equivalence, as growth functions of semigroups, hereditary languages, and algebras.

This paper examines the relationship between the companion forms of regular matrix polynomials with singular leading coefficients. When two such polynomials have the same underlying finite and infinite Jordan structures, it is shown that their companion forms are connected by a strict equivalence transformation that can be parameterized using the commutant of the companion forms' common Weierstrass canonical form. The process developed herein for generating such parameterized transformations is applied to the useful class of diagonalizable quadratic polynomials.

Several formalisms for language syntax specification exist in literature. In this paper, we prove that longstanding syntactical transformations between context-free grammars and algebraic signatures are adjoint functors and/or adjoint equivalences that preserve the abstract syntax of the generated terms. The main result is a categorical equivalence between the categories of algebras (i.e., all the possible semantics) over the objects in these formalisms up to the provided syntactical transformations, namely that all these language specification frameworks are essentially the same from a semantic perspective.

This research is a study on cultural word translation strategies from Indonesian into Japanese. The purposes of the study are: firstly, identifying cultural words that do not have any equivalence between the source language (TSu) secondly, investigating the translation strategies used for those words with no equivalence; and thirdly, finding out the meaning shift occurring in the process of translation. The research employs a descriptive qualitative method. The strategies used by the translator include: 1) translation using more general terms, 2) translation using loan words or loan words with explanation, 3) translation using paraphrase. Two meaning shifts are found: 1) shift from generic to more specific or vice versa, and 2) shift because of different cultural point of view.

We show basic results on super-manifolds and super Lie groups over a complete field of characteristic $\ne 2$, extensively using Hopf-algebraic techniques. The main results are two theorems. The first main theorem shows a category equivalence between super Lie groups and Harish-Chandra pairs, which is applied especially to construct the Hopf super-algebra of all analytic representative functions on a super Lie group. The second constructs homogeneous super-manifolds by a new Hopf-algebraic method, showing their remarkable property., Comment: Added an article, [4], and two remarks, Remarks 3.8 and 7.3

Considering a low power wide area random access system (like LoRaWAN) where the individual transmitters are mobile, we 1) propose a way of quantifying the performance of tracking of the mobile devices, and 2) design a distributed algorithm to achieve a target tracking performance. The insights gained are then used to provide an analysis of a family of target-achieving reinforcement-learning algorithms used in the literature to learn the optimal (Nash Equilibrium) random access probabilities. By mapping the payoff function in the equivalent game to the performance metric, we establish that, under some general conditions of inter-node parameter separability, the algorithm convergence is independent of the payoff function used. The mapping from the desired performance metric to the success probability in random access can be used in the algorithm to achieve a target success probability.

We prove that finite categorically equivalent p-rings have isomorphic additive groups (in particular, they have the same cardinality) and that the number of generators is a categorical invariant fo...

Cobordism of virtual string links on n strands is a combinatorial generalization of link cobordism. There exists a bijection between virtual string links on n strands up to cobordisms and elements of the direct product of n ( n − 1) copies of the integers. This paper also shows that virtual string links up to unwelded equivalence are classified by those groups. Finally, the related theory of welded string link cobordism is defined herein and shown to be trivial for string links with one component.

The hull of a linear code over finite fields, the intersection of the code and its dual, has been of interest and extensively studied due to its wide applications. For example, it plays a vital role in determining the complexity of algorithms for checking permutation equivalence of two linear codes and for computing the automorphism group of a linear code. People are interested in pursuing linear codes with small hulls since, for such codes, the aforementioned algorithms are very efficient. In this field, Carlet, Mesnager, Tang and Qi gave a systematic characterization of LCD codes, i.e, linear codes with null hull. In 2019, Carlet, Li and Mesnager presented some constructions of linear codes with small hulls. In the same year, Li and Zeng derived some constructions of linear codes with one-dimensional hull by using some specific Gaussian sums. In this paper, we use general Gaussian sums to construct linear codes with one-dimensional hull by utilizing number fields, which generalizes some results of Li and Zeng (IEEE Trans. Inf. Theory 65(3), 1668–1676, 2019) and also of those presented by Carlet et al. (Des. Codes Cryptogr. 87(12), 3063–3075, 2019). We give sufficient conditions to obtain such codes. Notably, some codes we obtained are optimal or almost optimal according to the Database. This is the first attempt on constructing linear codes by general Gaussian sums which have one-dimensional hull and are optimal. Moreover, we also develop a bound of on the minimum distances of linear codes we constructed.

International audience; We identify a new decidable class of security protocols, both for reachability and equivalence properties. Our result holds for an unbounded number of sessions and for protocols with nonces. It covers all standard cryptographic primitives. Our class sets up three main assumptions. (i) Protocols need to be "simple", meaning that an attacker can precisely identify from which participant and which session a message originates from. We also consider protocols with no else branches (only positive test). (ii) Protocols should be type-compliant, which is intuitively guaranteed as soon as two encrypted messages of the protocol cannot be confused. (iii) Finally, we define the notion of a dependency graph, which, given a protocol, characterises how actions depend on the other ones (both sequential dependencies and data dependencies are taken into account). Whenever the graph is acyclic, then the protocol falls into our class. We show that many protocols of the literature belong to our decidable class, including for example some of the protocols embedded in the biometric passport.

The extension problem underlies notions of code equivalence. Two approaches to the extension problem are described. One is a matrix approach that reduces the general problem for weights to one for symmetrized weight compositions. The other is a monoid algebra approach that reframes the extension problem in terms of modules over the monoid algebra determined by the multiplicative monoid of a finite ring.

We calculate topological Hausdorff dimensions of a class of fractal squares by constructing certain self-similar curves. Examples include some generalized Sierpinski carpets, which have the same Hausdorff dimensions but different topological Hausdorff dimensions. Applications are given to the study of Lipschitz equivalence of fractal squares.