Towards automated reasoning in Herbrand structures
Herbrand structures have the advantage, computationally speaking, of being guided by the definability of all elements in them. A salient feature of the logics induced by them is that they internally exhibit the induction scheme, thus providing a congenial, computationally oriented framework for form...
Main Authors: | Cohen, L. (Author), Rowe, R.N.S (Author), Zohar, Y. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Oxford University Press
2019
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences
by: Millson, J.
Published: (2019) -
Study on Students' Understanding of the Process Mathematical Proof Based on Mejia Ramos et al
by: E. Reyhani, et al.
Published: (2016-03-01) -
Graphical representation of canonical proof : two case studies
by: Heijltjes, Willem Bernard
Published: (2012) -
Using Figurate Numbers in Elementary Number Theory – Discussing a ‘Useful’ Heuristic From the Perspectives of Semiotics and Cognitive Psychology
by: Leander Kempen, et al.
Published: (2020-06-01) -
Teachers’ learning and assessing of mathematical processes with emphasis on representations, reasoning and proof
by: Satsope Maoto, et al.
Published: (2018-03-01)