Many-Sorted Logic in a Learning Theorem Prover

Lecture Notes in Computer Science - Germany
doi 10.1007/3540634932_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Characterization of the N-Ary Many-Sorted Closure Operators and a Many-Sorted Tarski Irredundant Basis Theorem

Quaestiones Mathematicae
Mathematics
2018English

Many-Sorted and Single-Sorted Algebras

Algebra Universalis
Number TheoryLogicAlgebra
2013English

Saoithín: A Theorem Prover for UTP

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Many-Valued and Many-Sorted Structure Relations

2019English

On Many-Sorted Ω-Categorical Theories

Fundamenta Mathematicae
Number TheoryAlgebra
2011English

A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Student Use of an Interactive Theorem Prover

Contemporary Mathematics
Mathematics
1984English

Modeling of ALFA Programs Using PVS Theorem Prover

2009English

How to Avoid the Formal Verification of a Theorem Prover

Logic Journal of the IGPL
Philosophy
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy