5. A set of formulas Mo is an axiom system for a set of formulas M if {A A is a model for Mo} = {A | A is a model for M} M is called finitely axiomatizable if it has a finite axiom system. Suppose {F1, F2, F3,...} is an axiom system for a set M where for all n ≥ 1, Fn+1 → Fn and Fn → Fn+1. Show that M is not finitely axiomatizable.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
This question is from course Advanced Logic in graduate level. Please give the answer, if yoy know, in a clear and understandable way, as soon as you can.
5. A set of formulas Mo is an axiom system for a set of formulas M if
{A A is a model for Mo} = {A | A is a model for M}
M is called finitely axiomatizable if it has a finite axiom system. Suppose {F1, F2, F3,...} is an axiom system
for a set M where for all n ≥ 1, = Fn+1 → Fn and FnFn+1. Show that M is not finitely axiomatizable.
Transcribed Image Text:5. A set of formulas Mo is an axiom system for a set of formulas M if {A A is a model for Mo} = {A | A is a model for M} M is called finitely axiomatizable if it has a finite axiom system. Suppose {F1, F2, F3,...} is an axiom system for a set M where for all n ≥ 1, = Fn+1 → Fn and FnFn+1. Show that M is not finitely axiomatizable.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

in the solution it says "Now, consider the model that satisfies all axioms in {A1, A2, ..., Ak} (since it's finite, it can be satisfied by a model), but also satisfies Fm because Fm implies Fm+1" but it is given that Fm doesnot imply fm+1

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Introduction to classical planning
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education