logicproofinductiondescription-logicfirst-order-logic
An Example from Description Logic Handbook
I dont understand this example very clearly. The example is taken from Description Logic Handbook.
At the last line of the example, "induction is required, hence such reasoning is not first order". That line completely took me off the guard.
your explanation is much appreicated.
Solution
The quote "induction is required, hence such reasoning is not first order" implies that any proof based on induction requires second-order arithmetic. Discussion of why the inductive form cannot be derived from first-order axioms can be found here and here.
- DCG LaTeX printer for FOL prover
- C# logic order and compiler behavior
- Is there a better way to write this if statements?
- is it permissible to create more than one class diagram?
- What is the optimal algorithm for the game 2048?
- Azure Logic App problem with user assigned managed identity
- To pause and resume the program execution in the command prompt
- How can I generalize my recurring business rules in .NET Core?
- Bitwise operators order of precedence
- Java Collections Logic / Over coding issue
- How can I use a for loop to check whether any value matches a condition?
- SQL getting the data by timestamp interval
- I need an optimal way to iterate through the array
- What is the point of 'else' after a block which ends in 'return'
- Reason for "all" and "any" result on empty lists
- Algorithm to distribute variably-sized items into balanced groups preserving items order
- What is 1 XOR 1 XOR 1?
- Trying to enable / disable Azure logic app at specific time period
- Loops and comparing variable values
- In each column of a data frame , how to find out the duration for which each unique value in a column existed?
- Redux business logic best practice
- Azure Logic Apps: ExpressionEvaluationFailed failed
- Why is Prolog's failure by negation not considered logical negation?
- Can I use Sumproduct arrays and check two separate criteria counting TRUE statements?
- R method for comparing NAs between two vectors
- Largest product in a grid
- Formualting a logic in farmer astronaught
- Project Euler Solution 8, Explanation needed
- SAT can be verified in polynomial time, by a conversion to CNF, then verifying the SAT of the CNF in polynomial. What is wrong with this argument?
- codingbat Problem: close_far | failing only one test | heeeelp