You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Fundamenta Informaticae - Volume 19, issue 3-4

Purchase individual online access for 1 year to this journal.

Price: EUR 410.00
ISSN 0169-2968 (P)
ISSN 1875-8681 (E)

Impact Factor 2024: 0.4

Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:


- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.

Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.

results per page

The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure Is Decidable with Respect to Its Diagram

Authors: Dańko, Wiktor

Article Type: Research Article

Abstract: In the paper it is considered a probabilistic logic of programs PrAL, similar to the Feldman-Harel logic, constructed for expressing properties of iterative programs with operations x : = ? , either … or … interpreted in a probabilistic way. A language of PrAL contains a sort of variables interpreted as real numbers, used to describe probabilities of behaviours of programs. The main result states that the set of formulas of PrAL valid in a finite structure is decidable with respect to the diagram of the structure.

DOI: 10.3233/FI-1993-193-411

Citation: Fundamenta Informaticae, vol. 19, no. 3-4, pp. 417-431, 1993

Price: EUR 27.50
Show more