Search results for "formal"
showing 10 items of 1654 documents
Inductive synthesis of dot expressions
2005
We consider the problem of the synthesis of algorithms by sample computations. We introduce a formal language, namely, the so-called dot expressions, which is based on a formalization of the intuitive notion of ellipsis (‘...’). Whilst formally the dot expressions are simply a language describing sets of words, on the other hand, it can be considered as a programming language supporting quite a wide class of programs. Equivalence and asymptotical equivalence of dot expressions are defined and proved to be decidable. A formal example of a dot expression is defined in the way that, actually, it represents a sample computation of the program presented by the given dot expression. A system of s…
FORMAL CONCEPTION OF ROUGH SETS
1996
In the paper we present a formal description of rough sets within the framework of the generalized set theory, which is interpreted in the set approximation theory. The rough sets are interpreted as approximations, which are defined by means of the Pawlak's rough sets.
Multi-letter reversible and quantum finite automata
2007
The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…
Functional Derivative Approach
2001
Let us now leave the path integral formalism temporarily and reformulate operatorial quantum mechanics in a way which will make it easy later on to establish the formal connection between operator and path integral formalism. Our objective is to introduce the generating functional into quantum mechanics. Naturally we want to generate transition amplitudes. The problem confronting us is how to transcribe operator quantum mechanics as expressed in Heisenberg’s equation of motion into a theory formulated solely in terms of c-numbers. This can be achieved either by Schwinger’s action principle or with the aid of a generation functional defined as follows:
A constructive semantics for non-deducibility
2008
This paper provides a constructive topological semantics for non-deducibility of a first order intuitionistic formula. Formal topology theory, in particular the recently introduced notion of a binary positivity predicate, and co-induction are two needful tools. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
Automatic calculation of massive two-loop self-energies with XLOOPS
1997
Abstract Within the program package XLOOPS it is possible to calculate self-energies up to the two-loop level for arbitrary massive particles. The program package — written in MAPLE (Char et al., Maple V Language Reference Manual (Springer, 1991); Char et al., Maple V Library Reference Manual (Springer, 1991)) — is designed to deal with the full tensor structure of the occurring integrals. This means that applications are not restricted to those cases where the reduction to scalars via equivalence theorem is allowed. The algorithms handle two-loop integrals analytically if this is possible. For those topologies where no analytic result for the general mass case is available, the diagrams ar…
GEOMETRIC EQUIVALENCE OF ALGEBRAS
2001
In this paper, we study the geometric equivalence of algebras in several varieties of algebras. We solve some of the problems formulated in [2], in particular, that of geometric equivalence for real-closed fields and finitely generated commutative groups.
Unification in superintuitionistic predicate logics and its applications
2018
AbstractWe introduce unification in first-order logic. In propositional logic, unification was introduced by S. Ghilardi, see Ghilardi (1997, 1999, 2000). He successfully applied it in solving systematically the problem of admissibility of inference rules in intuitionistic and transitive modal propositional logics. Here we focus on superintuitionistic predicate logics and apply unification to some old and new problems: definability of disjunction and existential quantifier, disjunction and existential quantifier under implication, admissible rules, a basis for the passive rules, (almost) structural completeness, etc. For this aim we apply modified specific notions, introduced in proposition…
Kontsevich formality and cohomologies for graphs
2004
A formality on a manifold M is a quasi isomorphism between the space of polyvector fields (Tpoly(M)) and the space of multidifferential operators (Dpoly(M)). In the case M=R d , such a mapping was explicitly built by Kontsevich, using graphs drawn in configuration spaces. Looking for such a construction step by step, we have to consider several cohomologies (Hochschild, Chevalley, and Harrison and Chevalley) for mappings defined on Tpoly. Restricting ourselves to the case of mappings defined with graphs, we determine the corresponding coboundary operators directly on the spaces of graphs. The last cohomology vanishes.
Star-products and phase space realizations of quantum groups
1992
It is shown for a family of *-products (i.e. different ordering rules) that, under a strong invariance condition, the functions of the quadratic preferred observables (which generate the Cartan subalgebra in phase space realization of Lie algebras) take only the linear or exponential form. An exception occurs for the case of a symmetric ordering *-product where trigonometric functions and two special polynomials can also be included. As an example, the ‘quantized algebra’ of the oscillator Lie algebra is argued.