Results 11 to 20 of about 114,330 (265)
Superposition for Full Higher-order Logic [PDF]
AbstractWe recently designed two calculi as stepping stones towards superposition for full higher-order logic: Boolean-free$$\lambda $$λ-superposition and superposition for first-order logic with interpreted Booleans. Stepping on these stones, we finally reach a sound and refutationally complete calculus for higher-order logic with polymorphism ...
Alexander Bentkamp +3 more
openaire +4 more sources
The Complexity of Model Checking Higher-Order Fixpoint Logic [PDF]
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that ...
Roland Axelsson +2 more
doaj +1 more source
Grundlagen §64: an alternative strategy to account for second-order abstraction
A famous passage in Section 64 of Frege’s Grundlagen may be seen as a justification for the truth of abstraction principles. The justification is grounded in the procedure of content recarving which Frege describes in the passage.
Vincenzo Ciccarelli
doaj +1 more source
Higher-Order Logic Programming [PDF]
Modern programming languages such as Lisp, Scheme and ML permit procedures to be encapsulated within data in such a way that they can subsequently be retrieved and used to guide computations. The languages that provide this kind of an ability are usually based on the functional programming paradigm, and the procedures that can be encapsulated in them ...
Dale Miller 0001, Gopalan Nadathur
openaire +1 more source
One of the main problems in representing information in the form of nonsystematic logic is the lack of flexibility, which leads to potential overfitting.
Yuan Gao +6 more
doaj +1 more source
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs [PDF]
Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on
Angelos Charalambidis +2 more
doaj +1 more source
Formal verification of Matrix based MATLAB models using interactive theorem proving [PDF]
MATLAB is a software based analysis environment that supports a high-level programing language and is widely used to model and analyze systems in various domains of engineering and sciences.
Ayesha Gauhar +4 more
doaj +2 more sources
Higher-order thinking skills are skills that are an important aspect of teaching and learning mathematics. Mathematics and culture have a very close relationship, so the development and application of mathematical concepts in the learning process must be
Sri Subarinah +3 more
doaj +1 more source
A relational logic for higher-order programs [PDF]
Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. Relational program verification can be used for reasoning about a broad range of properties, including equivalence and refinement, and specialized notions such ...
Alejandro Aguirre 0001 +4 more
openaire +5 more sources
Formal analysis of 2D image processing filters using higher-order logic theorem proving
Two-dimensional (2D) image processing systems are concerned with the processing of the images represented as 2D arrays and are widely used in medicine, transportation and many other autonomous systems.
Adnan Rashid, Sa’ed Abed, Osman Hasan
doaj +1 more source

