Logic programming that computational steps cannot be logically deduced. However, in concurrent logic programming, any result of a terminating computation is a logical consequence of the program, and any partial result of a partial computation is a logical consequence of the program and the residual goal (process network). Consequently, the indeterminacy of computations implies that not all logical consequences of the program can be deduced. Concurrent constraint logic programming combines concurrent logic programming and constraint logic programming, using constraints to control concurrency. A clause can contain a guard, which is a set of constraints that may block the applicability of the clause.
Is Logic Empirical? the microscopic world. In this view, classical logic was merely a limiting case of this new logic. If this were the case, then our "preconceived" Boolean logic would have to be rejected by empirical evidence in the same way Euclidean geometry (taken as the correct geometry of physical space) was rejected on the basis of (the facts supporting the theory of) general relativity. This argument is in favour of the view that the rules of logic are empirical. That logic came to be known as quantum logic. There are, however, few philosophers today who regard this logic as a replacement