Titlebook: Concrete Abstractions; Formalizing and Anal Wolfgang Schreiner Textbook 2023 The Editor(s) (if applicable) and The Author(s), under exclusi

harpsichord

Propositional Logic,The subject of this chapter are propositional formulas (also called Boolean expressions). In the following, we will sketch the theory of propositional formulas, discuss their normal forms, and investigate the problems of minimizing a propositional formula and determining its satisfiability.

努力趕上

影響帶來

Trade Unions in Western Europe since 1945rranging the elements in the array in a particular order (such that we may speed up subsequent searches). In the course of our elaboration, we will also discuss the principles of formal program/algorithm verification and how they are supported in RISCAL.

thrombus

Trade Unions in Western Europe since 1945ues. Since sets and relations can model the nodes and arrows of directed “graphs”, we take the opportunity to consider graph problems such as determining the reachability of nodes and the computation of shortest paths.

600

CRAMP

https://doi.org/10.1007/978-3-030-24914-4r is dedicated to the “l(fā)ighter” domain of recreational mathematics, which disguises computational problems in the entertaining form of . or .. From the large variety of mathematical games, we will choose some examples that can be naturally represented in the form of discrete systems that have a fini

粗野

otic-capsule

Academic Expert Knowledge on Free Trade, two recent additions that significantly enhance the capabilities of the software: first, checking specifications of nondeterministic and concurrent systems that are expressed in the language of . and, second, . in domains of arbitrary size.

使腐爛

,Theories and?Algorithms,ories, and algorithms that solve these problems. For this purpose, we shall in this chapter focus on the theory of (a certain kind of) numbers, the problem of computing the greatest common divisor (gcd) of two numbers, and the ancient Euclidean algorithm that computes the gcd.

hangdog

,Searching and?Sorting,rranging the elements in the array in a particular order (such that we may speed up subsequent searches). In the course of our elaboration, we will also discuss the principles of formal program/algorithm verification and how they are supported in RISCAL.