We present a formal development of the tensorial rotational Hamiltonian using symbolic calculations. Algebraic manipulations thanks to open-source Maxima software allow us get expressions use for various molecular spectroscopy problems. first some simple applications so-called semi-classical approach that allows study level structures in energy spectrum. Then, we perform comparisons between and...

Currently, the most commonly created formal languages are configuration languages. So far source code annotations and XML are the leading notations for configuration languages. In this paper, we analyse the correspondence between these two formats. We show that there are typical XML to annotations mapping solutions (mapping patterns) that indicate a correspondence between embedded and external ...

A basic survey across a given language pair normally reveals units that are structurally incongruent with one another, which demonstrates that translation cannot be reduced to establishing a straightforward correspondence between individual words. To properly render the meaning of the source text, translators must introduce translation shifts, i.e. departures from formal correspondence in the p...

This paper has three objectives. The first objective is to provide a simpler proof concerning a sufficient condition due to Ferfera under which bilinearity is preserved for cascade interconnections. The next objective is to provide a specific counterexample to show that this condition does not apply to the feedback connection. The final objective is to show that thewell-known correspondence bet...

In this paper, we present a linguistic approach in order to achieve the object oriented analysis (OOA) process in a systematic way. The approach is based on the definition of a formal correspondence between a subset of structures from linguistic world, called linguistic patterns, and a subset of structures from conceptual world, called conceptual patterns. This correspondence provides a solid b...

We report about a joint project of the universities at Karls-ruhe, Kiel and Ulm on how to get correct compilers for realistic programming languages. Arguing about compiler correctness must start from a compiling speciication describing the correspondence of source and target language in formal terms. We have chosen to use abstract state machines to formalize this correspondence. This allows us ...

In 2007, Kenneth Hammond published Beyond Rationality: The search for wisdom in a troubled time. In this book and in prior works, Hammond (1990; 1996) promotes the recognition and equal acceptance of two different classes of criteria for the assessment of human judgment and decision making (JDM). Coherence criteria are those that are based on normative standards of logic (or some other formal m...

We use modiied Tsirelson's spaces 3] to prove that there is no nite basis for turbulent Polish group actions. This answers a question of 1. Introduction One of the trends in Descriptive Set Theory during the last decade or so concerns the study of classiiability of Borel equivalence relations. Particularly well-studied are the orbit equivalence relations of Polish group actions (see 7, 10, 11, ...

We present a formulae-as-types interpretation of Subtractive Logic (i.e. bi-intuitionistic logic). This presentation is two-fold: we first define a very natural restriction of the λμ-calculus which is closed under reduction and whose type system is a constructive restriction of the Classical Natural Deduction. Then we extend this deduction system conservatively to Subtractive Logic. From a comp...