Automated deduction in classical and non-classical logics. Selected papers
DOI10.1007/3-540-46508-1zbMATH Open0933.00012OpenAlexW2481077391MaRDI QIDQ1967066FDOQ1967066
Authors:
Publication date: 8 March 2000
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-46508-1
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Mechanization of proofs and logical operations (03B35)
Cited In (10)
- Embedding and automating conditional logics in classical higher-order logic
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps
- Title not available (Why is that?)
- Three-variable statements of set-pairing
- Combining and automating classical and non-classical logics in classical higher-order logics
- Hilbert's epsilon as an operator of indefinite committed choice
- Title not available (Why is that?)
- Behavioral abstraction is hiding information
- Automated deduction. A basis for applications. Vol. 1: Foundations, calculi and methods
- Automated deduction. A basis for applications. Vol. 2: Systems and implementation techniques
Uses Software
This page was built for publication: Automated deduction in classical and non-classical logics. Selected papers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1967066)