The Logics’ Explorer: a Maple package for exploring finite many-valued propositional logics: The Logics' Explorer: a Maple package for exploring finite many-valued propositional logics

Συγγραφείς: Eugenio Roanes-Macías, José-Antonio Alonso, Eugenio Roanes-Lozano, Antonio Hernando, Luis M. Laita

Πηγή: Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas. 105:323-337

Θεματικοί όροι: Many-valued logic, 0202 electrical engineering, electronic engineering, information engineering, effective computation, 0102 computer and information sciences, 02 engineering and technology, Symbolic computation and algebraic computation, Software, source code, etc. for problems pertaining to mathematical logic and foundations, finite many-valued logics, 01 natural sciences, computer algebra systems

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://link.springer.com/content/pdf/10.1007%2Fs13398-011-0041-7.pdf
https://dialnet.unirioja.es/servlet/articulo?codigo=8104120
https://link.springer.com/article/10.1007/s13398-011-0041-7

Pandora: A Reasoning Toolbox using Natural Deduction Style: Pandora: A reasoning toolbox using natural deduction style

Συγγραφείς: Alexander J. Summers, Jiefei Ma, Krysia Broda, Gabrielle Sinnadurai

Πηγή: Logic Journal of IGPL. 15:293-304

Θεματικοί όροι: learning, predicate logic, 4. Education, 05 social sciences, Fitch box proof, reasoning about programs, natural deduction, Software, source code, etc. for problems pertaining to mathematical logic and foundations, 0503 education, teaching, e-learning, Technological tools, calculators (aspects of mathematics education), first-order logic

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://academic.oup.com/jigpal/article/15/4/293/618843
https://people.inf.ethz.ch/summersa/wiki/lib/exe/fetch.php?media=papers:pandora2.pdf
https://dblp.uni-trier.de/db/journals/igpl/igpl15.html#BrodaMSS07
https://philpapers.org/rec/BROPAR-8
https://www.doc.ic.ac.uk/~kb/papers/igpl-paper.pdf

Finding Missing Proofs with Automated Reasoning: Finding missing proofs with automated reasoning

Συγγραφείς: Branden Fitelson, Larry Wos

Πηγή: Studia Logica. 68:329-356

Θεματικοί όροι: Mechanization of proofs and logical operations, automated reasoning program OTTER, logic calculi, 0101 mathematics, condensed detachment, Software, source code, etc. for problems pertaining to mathematical logic and foundations, 01 natural sciences, axiomatic proofs, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1687393
https://doi.org/10.1023/a:1012486904520
https://philpapers.org/rec/FITFMP
https://link.springer.com/article/10.1023/A:1012486904520
https://dblp.uni-trier.de/db/journals/sLogica/sLogica68.html#FitelsonW01
https://link.springer.com/content/pdf/10.1023/A:1012486904520.pdf

finding missing proofs with automated reasoning: Finding missing proofs with automated reasoning

Συγγραφείς: Branden Fitelson, Larry Wos

Πηγή: Studia Logica. 68(3):329-356

Θεματικοί όροι: Mechanization of proofs and logical operations, automated reasoning program OTTER, logic calculi, condensed detachment, Software, source code, etc. for problems pertaining to mathematical logic and foundations, axiomatic proofs, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1687393
https://doi.org/10.1023/a:1012486904520
https://philpapers.org/rec/FITFMP
https://link.springer.com/article/10.1023/A:1012486904520
https://dblp.uni-trier.de/db/journals/sLogica/sLogica68.html#FitelsonW01
https://link.springer.com/content/pdf/10.1023/A:1012486904520.pdf

An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs

Συγγραφείς: Puddu, S., Sabia, J.

Πηγή: J. Pure Appl. Algebra 1998;129(2):173-200
Biblioteca Digital (UBA-FCEN)
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN

Θεματικοί όροι: Algebra and Number Theory, quantifier elimination, Quantifier elimination, model completeness, and related topics, Model-theoretic algebra, 0102 computer and information sciences, 0101 mathematics, Symbolic computation and algebraic computation, Software, source code, etc. for problems pertaining to mathematical logic and foundations, 01 natural sciences

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://zbmath.org/1308194
https://doi.org/10.1016/s0022-4049(97)00068-6
https://www.sciencedirect.com/science/article/pii/S0022404997000686
http://hdl.handle.net/20.500.12110/paper_00224049_v129_n2_p173_Puddu

Solving Problems on Finite Concrete Logics with the Help of a PC: Solving problems on finite concrete logics with the help of a PC

Συγγραφείς: Sultanbekov F.

Πηγή: SCOPUS00207748-1998-37-1-SID0032369960

Θεματικοί όροι: orthomodular posets, atoms, minimal representations, blocks, finite concrete logics, Logical foundations of quantum mechanics, quantum logic (quantum-theoretic aspects), Software, source code, etc. for problems pertaining to mathematical logic and foundations, generators, Quantum logic, Turbo Pascal programs

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1196983
https://doi.org/10.1023/a:1026694013057
https://openrepository.ru/article?id=128830
https://openrepository.ru/article?id=172119
https://link.springer.com/article/10.1023%2FA%3A1026694013057
https://link.springer.com/content/pdf/10.1023/A:1026694013057.pdf

LWBtheory: Information about some propositional logics via the WWW

Συγγραφείς: Heuerding, A.

Πηγή: Heuerding, Alain (1997). LWBtheory: Information about some propositional logics via the WWW. Logic Journal of IGPL, 5(1), pp. 169-174. Oxford University Press 10.1093/jigpal/5.1.169 <http://dx.doi.org/10.1093/jigpal/5.1.169>

Θεματικοί όροι: WWW, 06 humanities and the arts, 0603 philosophy, ethics and religion, Software, source code, etc. for problems pertaining to mathematical logic and foundations, propositional logics

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://boris.unibe.ch/116057/1/050169.pdf
https://dblp.uni-trier.de/db/journals/igpl/igpl5.html#Heuerding97
https://academic.oup.com/jigpal/article/5/1/169/643403
https://boris.unibe.ch/116057/
http://doc.rero.ch/record/302917/files/050169.pdf

A type-theoretic interpretation of constructive domain theory: A type theoretic interpretation of constructive domain theory

Συγγραφείς: Michael Hedberg

Πηγή: Journal of Automated Reasoning. 16:369-425

Θεματικοί όροι: constructive type theory, interactive proof assistant ALF, semilattices, domain, Semantics in the theory of computing, Semilattices, 0102 computer and information sciences, Cartesian closed category, 01 natural sciences, \(\lambda\)-calculus, Combinatory logic and lambda calculus, approximable mappings, 0101 mathematics, Second- and higher-order arithmetic and fragments, Software, source code, etc. for problems pertaining to mathematical logic and foundations, Categorical logic, topoi, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/934093
https://doi.org/10.1007/bf00252182
https://link.springer.com/article/10.1007/BF00252182
https://dblp.uni-trier.de/db/journals/jar/jar16.html#Hedberg96

HYPERSOLVER: A graphical tool for commonsense set theory

Συγγραφείς: dat Pakkan, Varol Akman, Mü jdot

Πηγή: Information Sciences

Θεματικοί όροι: Computation theory, non-well-founded sets, Commonsense set theory, 02 engineering and technology, Formal logic, 01 natural sciences, Computer graphics, 0202 electrical engineering, electronic engineering, information engineering, Computer software, commonsense reasoning, 0101 mathematics, Commonsense reasoning, Problem solving, Logic in artificial intelligence, Hyperset theory, Graphical tool, Hyperset Theory, Hypersolver, Mechanization of proofs and logical operations, graphical representation for sets, HYPERSOLVER, Nonclassical and second-order set theories, Set theory, systems of equations, Software, source code, etc. for problems pertaining to mathematical logic and foundations

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://repository.bilkent.edu.tr/bitstream/11693/25905/1/HYPERSOLVER%20A%20graphical%20tool%20for%20commonsense%20set%20theory.pdf
https://zbmath.org/1022304
https://doi.org/10.1016/0020-0255(94)00114-q
https://dblp.uni-trier.de/db/journals/isci/isci85.html#PakkanA95
http://www.sciencedirect.com/science/article/pii/002002559400114Q
https://philpapers.org/rec/PAKHAG
https://www.sciencedirect.com/science/article/pii/002002559400114Q
http://cogprints.org/466/index.html
https://doi.org/10.1016/0020-0255(94)00114-Q
https://hdl.handle.net/11693/25905

Set theory for verification. II: Induction and recursion

Συγγραφείς: Lawrence C. Paulson

Πηγή: Journal of Automated Reasoning. 15:167-215

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, recursive functions, D.2.4, 02 engineering and technology, Knaster-Tarski theorem, 01 natural sciences, Logic in Computer Science (cs.LO), inductively defined sets, recursive data structures, 0202 electrical engineering, electronic engineering, information engineering, Applications of set theory, F.4.1, F.3.1, 0101 mathematics, Software, source code, etc. for problems pertaining to mathematical logic and foundations, Theorem proving (deduction, resolution, etc.), Schröder-Bernstein theorem

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-312.pdf
http://arxiv.org/abs/cs/9511102

A Ramsey theorem in Boyer-Moore logic

Συγγραφείς: Kenneth Kunen

Πηγή: Journal of Automated Reasoning. 15:217-235

Θεματικοί όροι: First-order arithmetic and fragments, Nqthm, ordinal, primitive recursive arithmetic, 0101 mathematics, Paris-Harrington version of Ramsey's theorem, Software, source code, etc. for problems pertaining to mathematical logic and foundations, Boyer-Moore prover, 01 natural sciences, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://link.springer.com/article/10.1007/BF00881917
https://dblp.uni-trier.de/db/journals/jar/jar15.html#Kunen95

OTTER experiments in a system of combinatory logic

Συγγραφείς: Thomas Jech

Πηγή: Journal of Automated Reasoning. 14:413-426

Θεματικοί όροι: illative combinatory logic, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, experiments involving the automated theorem-proving program OTTER, TRC, Mathematics - Logic, 02 engineering and technology, 0101 mathematics, Logic (math.LO), Software, source code, etc. for problems pertaining to mathematical logic and foundations, 01 natural sciences, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/math/9409201v1.pdf
http://arxiv.org/abs/math/9409201
https://zbmath.org/769078
https://doi.org/10.1007/bf00881715
https://ui.adsabs.harvard.edu/abs/1994math......9201J/abstract
https://link.springer.com/article/10.1007%2FBF00881715
https://dblp.uni-trier.de/db/journals/jar/jar14.html#Jech95

A Computational Study of Satisfiability Algorithms for Propositional Logic: A computational study of satisfiability algorithms for propositional logic

Συγγραφείς: Farid Harche, John N. Hooker, Gerald L. Thompson

Πηγή: ORSA Journal on Computing. 6:423-435

Θεματικοί όροι: Classical propositional logic, tree search, satisfiability problem, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, algorithms, Software, source code, etc. for problems pertaining to mathematical logic and foundations, propositional logic

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://pubsonline.informs.org/doi/abs/10.1287/ijoc.6.4.423
https://doi.org/10.1287/ijoc.6.4.423
https://dblp.uni-trier.de/db/journals/informs/informs6.html#HarcheHT94
https://ideas.repec.org/a/inm/orijoc/v6y1994i4p423-435.html

A Microcomputer Based System for Small Relation Algebras: A microcomputer based system for small relation algebras

Συγγραφείς: Ivo Düntsch

Πηγή: Journal of Symbolic Computation. 18:83-86

Θεματικοί όροι: Computational Mathematics, Algebra and Number Theory, Cylindric and polyadic algebras, relation algebras, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, Symbolic computation and algebraic computation, Software, source code, etc. for problems pertaining to mathematical logic and foundations, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/710088
https://doi.org/10.1006/jsco.1994.1037
https://www.sciencedirect.com/science/article/abs/pii/S0747717184710376
https://dblp.uni-trier.de/db/journals/jsc/jsc18.html#Duntsch94
https://doi.org/10.1006/jsco.1994.1037
https://www.sciencedirect.com/science/article/pii/S0747717184710376
https://core.ac.uk/display/82291829

Sentential constants in systems near R

Συγγραφείς: John Slaney

Πηγή: Studia Logica. 52:443-455

Θεματικοί όροι: Matrix Generator for Implication Connectives, Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics), relevant logic, Ackermann constant, algebraic model, 0102 computer and information sciences, 0101 mathematics, Software, source code, etc. for problems pertaining to mathematical logic and foundations, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/488347
https://doi.org/10.1007/bf01057657
https://dblp.uni-trier.de/db/journals/sLogica/sLogica52.html#Slaney93
https://link.springer.com/article/10.1007/BF01057657

Set theory for verification: I. From foundations to functions: Set theory for verification. I: From foundations to functions

Συγγραφείς: Lawrence C. Paulson

Πηγή: Journal of Automated Reasoning. 11:353-389

Θεματικοί όροι: interactive proofs, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Zermelo-Fraenkel set theory, D.2.4, Cantor's theorem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO), higher-order syntax, Ramsey's theorem, 0202 electrical engineering, electronic engineering, information engineering, Applications of set theory, F.4.1, Isabelle, F.3.1, generic theorem proving, Software, source code, etc. for problems pertaining to mathematical logic and foundations, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/cs/9311103
https://zbmath.org/549828
https://doi.org/10.1007/bf00881873

The application of automated reasoning to questions in mathematics and logic

Συγγραφείς: William McCune, Larry Wos

Πηγή: Annals of Mathematics and Artificial Intelligence. 5:321-369

Θεματικοί όροι: equivalential calculus, finite semigroup, 0102 computer and information sciences, 02 engineering and technology, combinatory logic, 01 natural sciences, Mechanization of proofs and logical operations, object construction, 0202 electrical engineering, electronic engineering, information engineering, proof finding, conjecture formulation, Software, source code, etc. for problems pertaining to mathematical logic and foundations, OTTER, automated reasoning, Robbins algebra, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/amai/amai5.html#WosM92
https://link.springer.com/article/10.1007%2FBF01543481

The existential graphs

Συγγραφείς: Don D. Roberts

Πηγή: Computers & Mathematics with Applications. 23:639-663

Θεματικοί όροι: Artificial intelligence, Alpha, quantifiers, consistency, Beta, General logic, 06 humanities and the arts, 02 engineering and technology, Philosophical and critical aspects of logic and foundations, 0603 philosophy, ethics and religion, Peirce's logic diagrams, relations, computational model, Computational Mathematics, Computational Theory and Mathematics, Modelling and Simulation, 0202 electrical engineering, electronic engineering, information engineering, Software, source code, etc. for problems pertaining to mathematical logic and foundations

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/109181
https://doi.org/10.1016/0898-1221(92)90127-4
https://www.sciencedirect.com/science/article/pii/0898122192901274#!
https://core.ac.uk/display/82124291
https://www.sciencedirect.com/science/article/pii/0898122192901274
http://www.sciencedirect.com/science/article/pii/0898122192901274

Condensed detachment is complete for relevance logic: A computer-aided proof

Συγγραφείς: Grigori Mints, Tanel Tammet

Πηγή: Journal of Automated Reasoning. 7:587-596

Θεματικοί όροι: condensed detachment rule, Mechanization of proofs and logical operations, Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics), 0102 computer and information sciences, 0101 mathematics, Software, source code, etc. for problems pertaining to mathematical logic and foundations, relevance logic, 01 natural sciences, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/jar/jar7.html#MintsT91
https://link.springer.com/content/pdf/10.1007/BF01880330.pdf
https://link.springer.com/article/10.1007/BF01880330

Algorithms for finding matrix models of propositional calculi

Συγγραφείς: Paul Pritchard

Πηγή: Journal of Automated Reasoning. 7:475-487

Θεματικοί όροι: constraint satisfaction, refutation-driven backtracking algorithm, computational experience, Software, source code, etc. for problems pertaining to mathematical logic and foundations, propositional calculus, matrix models, Theorem proving (deduction, resolution, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/28713
https://doi.org/10.1007/bf01880325
https://link.springer.com/article/10.1007/BF01880325
https://dblp.uni-trier.de/db/journals/jar/jar7.html#Pritchard91