scispace - formally typeset
Open Access

Handbook of logic in computer science.

About
The article was published on 1992-01-01 and is currently open access. It has received 637 citations till now. The article focuses on the topics: Computational logic & Logic in computer science.

read more

Citations
More filters
Proceedings ArticleDOI

Requirements engineering: a roadmap

TL;DR: An overview of the field of software systems requirements engineering (RE) is presented, describing the main areas of RE practice, and highlights some key open research issues for the future.

Ministry of Education and Science of the Russian Federation

TL;DR: The abstract should follow the structure of the article (relevance, degree of exploration of the problem, the goal, the main results, conclusion) and characterize the theoretical and practical significance of the study results.
Proceedings Article

Domain theory

TL;DR: In this paper, the authors define abstract bases as the bases of compact elements of algebraic domains and define the notion of ideal completion as the relation with which a basis can be equipped.
Journal ArticleDOI

A framework for comparing models of computation

TL;DR: A denotational framework (a "meta model") within which certain properties of models of computation can be compared is given, which describes concurrent processes in general terms as sets of possible behaviors.
Journal ArticleDOI

Explicit Provability and Constructive Semantics

TL;DR: This paper finds the logic LP of propositions and proofs and shows that Godel's provability calculus is nothing but the forgetful projection of LP, which achievesGodel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which resisted formalization since the early 1930s.
References
More filters
Proceedings ArticleDOI

Requirements engineering: a roadmap

TL;DR: An overview of the field of software systems requirements engineering (RE) is presented, describing the main areas of RE practice, and highlights some key open research issues for the future.

Ministry of Education and Science of the Russian Federation

TL;DR: The abstract should follow the structure of the article (relevance, degree of exploration of the problem, the goal, the main results, conclusion) and characterize the theoretical and practical significance of the study results.
Proceedings Article

Domain theory

TL;DR: In this paper, the authors define abstract bases as the bases of compact elements of algebraic domains and define the notion of ideal completion as the relation with which a basis can be equipped.
Journal ArticleDOI

A framework for comparing models of computation

TL;DR: A denotational framework (a "meta model") within which certain properties of models of computation can be compared is given, which describes concurrent processes in general terms as sets of possible behaviors.
Journal ArticleDOI

Explicit Provability and Constructive Semantics

TL;DR: This paper finds the logic LP of propositions and proofs and shows that Godel's provability calculus is nothing but the forgetful projection of LP, which achievesGodel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which resisted formalization since the early 1930s.