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 81, issue 1-3

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

A Propositional Programming Environment for Linear Algebra

Authors: Srebrny, Marian | St�pień, Lidia

Article Type: Research Article

Abstract: In this paper we present an application of the propositional SATisfiability environment to computing bases of some vector spaces. As a motivation we refer to certain computational tasks in the area of the algebraic theory of quadratic forms; more precisely, in the theory of Witt rings of quadratic forms. As known in algebra, the problem of finding all automorphisms of an elementary Witt ring can be reduced to searching for some special kind of bases of … Show more

Citation: Fundamenta Informaticae, vol. 81, no. 1-3, pp. 325-345, 2007

Price: EUR 27.50

An Interpretation of Robinson Arithmetic in its Grzegorczyk's Weaker Variant

Authors: Švejdar, Vítězslav

Article Type: Research Article

Abstract: Q^- is a weaker variant of Robinson arithmetic Q in which addition and multiplication are partial functions, i.e. ternary relations that are graphs of possibly non-total functions. We show that Q is interpretable in Q^- . This gives an alternative answer to a question of A. Grzegorczyk whether Q^- is essentially undecidable.

Citation: Fundamenta Informaticae, vol. 81, no. 1-3, pp. 347-354, 2007

Price: EUR 27.50

Logic, Rationality and Psychologism

Authors: Woleński, Jan

Article Type: Research Article

Citation: Fundamenta Informaticae, vol. 81, no. 1-3, pp. 355-365, 2007

Price: EUR 27.50
Show more