Skip to search formSkip to main contentSkip to account menu

Algorithmic logic

Algorithmic logic is a calculus of programs which allows the expression of semantic properties of programs by appropriate logical formulas. It… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmDynamic logic (modal logic)First-order logicSoftware framework

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Incremental gravitational search algorithm for high-dimensional benchmark functions
In this study, gravitational search algorithm (GSA), which is a powerful optimization algorithm developed in recent years and… 
2016
2016
On the role of student understanding of function and rate of change in learning differential equations
2015
2015
The Relationship between Students' Performance on Conventional Standardized Mathematics Assessments and Complex Mathematical Modeling Problems.
Critical to many science, technology, engineering, and mathematics (STEM) career paths is mathematical modeling—specifically, the… 
2011
2011
Task-oriented System Engineering
Traditional system engineering (SE) is technology driven. In the design of interactive systems we typically assume that the human… 
2010
2010
Eight years of journey with Logo leading to the Eiffel tower mathematical project
Eight years ago, our school in Mexico was introduced to Logo as part of the governmentsponsored Teaching Mathematics with… 
2007
2007
Argumentation in a Geometry Class : Aligned with the Teacher ’ s Conception of Proof 1
While a straightforward relationship between argumentation and proof is not universally accepted, it is reasonable that… 
1989
1989
Recursive (omega)o-Rule for Proof Systems
1984
1984
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
1981
1981
On logic of complex algorithms
An algebraic approach to programs called recursive coroutines — due to Janicki [3] — is based on the idea to consider certain… 
1980
1980
The Role of Finite Automata in the Development of Modern Computing Theory
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)