Looking for Busy Beavers. A socio-philosophical study of a computer-assisted proof. Liesbeth De Mol∗ [removed]

Source URL: logica.ugent.be

• Computer science
• Theory of computation
• Busy beaver
• Turing machine
• Halting problem
• Computable function
• Alan Turing
• Mathematical proof
• Computability
• Mathematics
• Theoretical computer science
• Computability theory

Spoiled for Choice?∗ Diderik Batens Centre for Logic and Philosophy of Science Ghent University, Belgium [removed]

Source URL: logica.ugent.be

• Paraconsistent logic
• Philosophical logic
• Propositional calculus
• Model theory
• Interpretation
• Propositional variable
• Classical logic
• Logic
• Mathematical logic
• Non-classical logic

Roy Cook, Paradoxes. In zijn Paradoxes geeft Roy T. Cook een overzicht van de meest invloedrijke logische en epistemologische paradoxen uit de geschiedenis van de filosofie, met bijzondere aandacht voor de paradoxen die

Source URL: logica.ugent.be

A modal language for contextual computations Giuseppe Primiero FWO - Research Foundation Flanders Centre for Logic and Philosophy of Science University of Ghent (Belgium) June 27, 2012

Source URL: logica.ugent.be

• Model theory
• Proof theory
• Propositional calculus
• Natural deduction
• Entailment
• Modal logic
• Interpretation
• Valuation
• Kripke semantics
• Logic
• Philosophical logic
• Deduction

Justifications and Wrong Judgements Giuseppe Primiero FWO - Research Foundation Flanders Centre for Logic and Philosophy of Science, Ghent University [removed]

Source URL: logica.ugent.be

• Education
• Justification
• Metatheory
• Critical thinking
• Epistemology
• Primiero
• Theory of justification
• Per Martin-Löf
• Logic
• Philosophy
• Branches of philosophy
• Knowledge

La d´ecouverte de la calculabilit´e L. De Mol Generating, solving and the mathematics of Homo Sapiens.

Source URL: logica.ugent.be

• Mathematics
• Theory of computation
• Alan Turing
• Models of computation
• Church–Turing thesis
• Turing machine
• Halting problem
• Computable function
• Algorithm
• Computability theory
• Theoretical computer science
• Computer science

Realist consequence, epistemic inference, computational correctness Giuseppe Primiero FWO – Research Foundation Flanders Centre for Logic and Philosophy of Science, Ghent University

Source URL: logica.ugent.be

• Deduction
• Axiology
• Correctness
• Entailment
• Inference
• Economic model
• Logic
• Logical consequence
• Theoretical computer science

The proof is in the process. A preamble for a philosophy of computer-assisted mathematics Liesbeth De Mol Mechanization tends to emphasize practice rather than theory, deeds rather than words, explicit answers rather tha

Source URL: logica.ugent.be

• Derrick Henry Lehmer
• Computer music
• Algorithm
• Computer science
• Computer
• Computing
• Mathematical proof
• Human–computer interaction
• ENIAC
• Mathematics
• Philosophy of mathematics
• Mathematical logic

Dynamic Proof Theories For Input/Output Logic Christian Straßer, Mathieu Beirlaen, and Frederik Van De Putte Centre for Logic and Philosophy of Science Ghent University August 28, 2013 Abstract

Source URL: logica.ugent.be

• Non-classical logic
• Modal logic
• Philosophical logic
• Model theory
• Deontic logic
• Default logic
• Function
• Interpretation
• Dc
• Logic
• Mathematical logic
• Mathematics

ON THE NECESSITY OF (SOMETIMES) BEING SYNTHETIC COMMENT ON POGGIOLESI Giuseppe Primiero Universiteit Gent IEG – University of Oxford

Source URL: logica.ugent.be

• Non-classical logic
• Mathematical logic
• Logical syntax
• Mathematical proof
• Paraconsistent logic
• Intuitionism
• Analytic proof
• Modal logic
• Formal proof
• Logic
• Philosophical logic
• Proof theory