monadic predicate ukasiewicz logic standard versus
play

Monadic Predicate ukasiewicz Logic. Standard versus General - PowerPoint PPT Presentation

Jan 27, 2023 •326 likes •1.04k views

Monadic Predicate ukasiewicz Logic. Standard versus General Tautologies Flix Bou University of Barcelona (UB) bou@ub.edu May 20th ASUV 2011 (Salerno) Flix Bou (UB) Monadic Predicate ukasiewicz Logic May 20th, ASUV2011, Salerno 1 /

  1. Monadic Predicate Łukasiewicz Logic. Standard versus General Tautologies Félix Bou University of Barcelona (UB) bou@ub.edu May 20th ASUV 2011 (Salerno) Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 1 / 23

  2. Preliminaries Classical Predicate Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ ) + vocabulary ϑ Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 2 / 23

  3. Preliminaries Classical Predicate Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ ) + vocabulary ϑ Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 2 / 23

  4. Preliminaries Classical Predicate Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ ) + vocabulary ϑ Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: 2-valued (for every structure, we get a mapping from sentences into { 0 , 1 } ). Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 2 / 23

  5. Preliminaries Classical Predicate Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ ) + vocabulary ϑ Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: 2-valued (for every structure, we get a mapping from sentences into { 0 , 1 } ). Full vocabulary Valid sentences are recursively enumerable (Gödel) Undecidability of valid sentences (Church, . . . ) FO 2 is decidable: “effective fmp” holds (Scott, Mortimer) FO 3 is undecidable (Surányi, . . . ) Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 2 / 23

  6. Preliminaries Classical Predicate Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ ) + vocabulary ϑ Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: 2-valued (for every structure, we get a mapping from sentences into { 0 , 1 } ). Full vocabulary Valid sentences are recursively enumerable (Gödel) Undecidability of valid sentences (Church, . . . ) FO 2 is decidable: “effective fmp” holds (Scott, Mortimer) FO 3 is undecidable (Surányi, . . . ) Monadic vocabulary: P 1 , P 2 , P 3 , . . . Decidability of valid sentences: filtration method provides an “effective fmp” (Löwenheim). Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 2 / 23

  7. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  8. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Definable symbols: ⊙ , ⊕ , ⊖ , etc . Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  9. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Definable symbols: ⊙ , ⊕ , ⊖ , etc . Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  10. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Definable symbols: ⊙ , ⊕ , ⊖ , etc . Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: [ 0 , 1 ] -valued (for every structure, we get a mapping from sentences into [ 0 , 1 ] ). Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  11. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Definable symbols: ⊙ , ⊕ , ⊖ , etc . Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: [ 0 , 1 ] -valued (for every structure, we get a mapping from sentences into [ 0 , 1 ] ). Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  12. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Definable symbols: ⊙ , ⊕ , ⊖ , etc . Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: [ 0 , 1 ] -valued (for every structure, we get a mapping from sentences into [ 0 , 1 ] ). ∀ xPx = ∃ x ( Px ∨ ¬ Px ) = Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  13. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Definable symbols: ⊙ , ⊕ , ⊖ , etc . Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: [ 0 , 1 ] -valued (for every structure, we get a mapping from sentences into [ 0 , 1 ] ). ∀ xPx = 0 . 2 ∃ x ( Px ∨ ¬ Px ) = Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  14. Preliminaries Predicate Łukasiewicz (standard) Logic Syntax: Primitive symbols ( ∀ , ∃ , ¬ , ∨ , ∧ , → ) + vocabulary ϑ Definable symbols: ⊙ , ⊕ , ⊖ , etc . Examples of Sentences: ∀ xPx , ∀ x ∃ yRxy , etc. Semantics: [ 0 , 1 ] -valued (for every structure, we get a mapping from sentences into [ 0 , 1 ] ). ∀ xPx = 0 . 2 ∃ x ( Px ∨ ¬ Px ) = 1 Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 3 / 23

  15. Preliminaries Three semantics using MV-chains Standard ( stL ∀ ): [ 0 , 1 ] -valued General ( genL ∀ ): A -valued (where A is an arbitrary MV-chain) structures requiring “safeness” condition (all formulas in ϑ have a truth value). Supersound ( spsL ∀ ): A -valued (where A is an arbitrary MV-chain) structures only requiring the existence of the value of your formula. Some Trivial Remarks Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 4 / 23

  16. Preliminaries Three semantics using MV-chains Standard ( stL ∀ ): [ 0 , 1 ] -valued General ( genL ∀ ): A -valued (where A is an arbitrary MV-chain) structures requiring “safeness” condition (all formulas in ϑ have a truth value). Supersound ( spsL ∀ ): A -valued (where A is an arbitrary MV-chain) structures only requiring the existence of the value of your formula. Some Trivial Remarks spsL ∀ ⊆ genL ∀ ⊆ stL ∀ Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 4 / 23

  17. Preliminaries Three semantics using MV-chains Standard ( stL ∀ ): [ 0 , 1 ] -valued General ( genL ∀ ): A -valued (where A is an arbitrary MV-chain) structures requiring “safeness” condition (all formulas in ϑ have a truth value). Supersound ( spsL ∀ ): A -valued (where A is an arbitrary MV-chain) structures only requiring the existence of the value of your formula. Some Trivial Remarks spsL ∀ ⊆ genL ∀ ⊆ stL ∀ Safeness holds when A is complete (e.g., A finite). Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 4 / 23

  18. Preliminaries Three semantics using MV-chains Standard ( stL ∀ ): [ 0 , 1 ] -valued General ( genL ∀ ): A -valued (where A is an arbitrary MV-chain) structures requiring “safeness” condition (all formulas in ϑ have a truth value). Supersound ( spsL ∀ ): A -valued (where A is an arbitrary MV-chain) structures only requiring the existence of the value of your formula. Some Trivial Remarks spsL ∀ ⊆ genL ∀ ⊆ stL ∀ Safeness holds when A is complete (e.g., A finite). Safeness holds in the following cases: finite structures, structures where the range of vocabulary symbols is finite (“secure”), witnessed structures. Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 4 / 23

  19. Preliminaries Full vocabulary genL ∀ is Σ 1 -complete (Chang, Belluce) stL ∀ is not in Σ 1 (Scarpellini) stL ∀ is Π 2 -complete (Ragaz) stL ∀ = � n ∈ ω Taut ( L n ) = Taut ([ 0 , 1 ] ∩ Q ) . (Rutledge) General and standard semantics are complete for witnessed structures (Hájek) Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 5 / 23

  20. Preliminaries Full vocabulary genL ∀ is Σ 1 -complete (Chang, Belluce) stL ∀ is not in Σ 1 (Scarpellini) stL ∀ is Π 2 -complete (Ragaz) stL ∀ = � n ∈ ω Taut ( L n ) = Taut ([ 0 , 1 ] ∩ Q ) . (Rutledge) General and standard semantics are complete for witnessed structures (Hájek) Monadic vocabulary: P 1 , P 2 , P 3 , . . . stL ∀ is in Π 1 . Filtration method shows fmp (i.e., if ϕ �∈ stL ∀ then it is not valid in some finite [ 0 , 1 ] -structure) (Hájek) standard and general semantics coincide for FO 1 , and it is decidable (Rutledge) standard and general semantics coincide for “classical formulas” (i.e., ∀ , ∃ , ¬ , ∧ , ∨ ), and this fragment is decidable. Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 5 / 23

  21. Preliminaries From Scarpellini’s (and Ragaz) result it follows that there are sentences which are standard tautologies while not general tautologies, but his proof do not provide us any explicit example. . Félix Bou (UB) Monadic Predicate Łukasiewicz Logic May 20th, ASUV2011, Salerno 6 / 23

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

A Gentle Introduction to Mathematical Fuzzy Logic 3. Predicate ukasiewicz and GdelDummett

A Gentle Introduction to Mathematical Fuzzy Logic 3. Predicate ukasiewicz and GdelDummett

A Gentle Introduction to Mathematical Fuzzy Logic 3. Predicate ukasiewicz and GdelDummett logic Petr Cintula 1 and Carles Noguera 2 1 Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic 2 Institute of

1.37k views • 79 slides
Arithmetic interpretation of the monadic fragment of intuitionistic predicate logic and

Arithmetic interpretation of the monadic fragment of intuitionistic predicate logic and

Arithmetic interpretation of the monadic fragment of intuitionistic predicate logic and Casaris formula Arithmetic interpretation of the monadic fragment of intuitionistic predicate logic and Casaris formula Julia Ilin joint work with

1.13k views • 94 slides
SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES Singular Sentences (monadic) Paris is beautiful

SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES Singular Sentences (monadic) Paris is beautiful

SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES Singular Sentences (monadic) Paris is beautiful name predicate (monadic) individual Bp predicate letter constant Singular Sentences These are our new simple formulae, just Bp like the

1.1k views • 62 slides
The Foundations: Logic and Proofs Chapter 1, Part II: Predicate Logic Summary Predicate Logic

The Foundations: Logic and Proofs Chapter 1, Part II: Predicate Logic Summary Predicate Logic

The Foundations: Logic and Proofs Chapter 1, Part II: Predicate Logic Summary Predicate Logic (First-Order Logic (FOL), Predicate Calculus) n The Language of Quantifiers n Logical Equivalences n Nested Quantifiers n Translation from Predicate

1.36k views • 58 slides
Equality 1 Predicate logic with equality Predicate logic + distinguished predicate symbol =

Equality 1 Predicate logic with equality Predicate logic + distinguished predicate symbol =

First-order Predicate Logic Equality 1 Predicate logic with equality Predicate logic + distinguished predicate symbol = of arity 2 Semantics: A structure A of predicate logic with equality always maps the predicate symbol = to the

401 views • 6 slides
3/28/16 Predicate Logic n Some statements cannot be expressed in propositional logic, such as:

3/28/16 Predicate Logic n Some statements cannot be expressed in propositional logic, such as:

3/28/16 Predicate Logic n Some statements cannot be expressed in propositional logic, such as: Predicate Logic n All men are mortal. (Rosen, Sections 1.4, 1.5) n Some trees have needles. TOPICS n X > 3. Universal Quantifiers n Predicate

57 views • 4 slides
05Predicate Logic CS 5209: Foundation in Logic and AI Martin Henz and Aquinas Hobor February

05Predicate Logic CS 5209: Foundation in Logic and AI Martin Henz and Aquinas Hobor February

Predicate Logic: Motivation, Syntax, Proof Theory Semantics of Predicate Logic Soundness and Completeness of Predicate Logic Undecidability of Predicate Logic 05Predicate Logic CS 5209: Foundation in Logic and AI Martin Henz and Aquinas

1.36k views • 69 slides
ukasiewicz logic is nullary Topology, Algebra, and Categories in Logic

ukasiewicz logic is nullary Topology, Algebra, and Categories in Logic

The unication type ukasiewicz logic is nullary Topology, Algebra, and Categories in Logic http://logica.dmi.unisa.it/lucaspada University of Salerno Department of Mathematics Luca Spada Based on a joint work with V. Marra The

1.24k views • 110 slides
Syntax of Predicate Logic Syntax of Predicate Logic 1/25 The Language of Predicate Logic object

Syntax of Predicate Logic Syntax of Predicate Logic 1/25 The Language of Predicate Logic object

Syntax of Predicate Logic Syntax of Predicate Logic 1/25 The Language of Predicate Logic object of the domain. or false. They describe properties of objects or relationships between objects. true? Syntax of Predicate Logic 2/25 Domain:

679 views • 25 slides
Predicate Logic: Introduction and Translations Alice Gao Lecture 10 CS 245 Logic and

Predicate Logic: Introduction and Translations Alice Gao Lecture 10 CS 245 Logic and

Predicate Logic: Introduction and Translations Alice Gao Lecture 10 CS 245 Logic and Computation Fall 2019 1 / 28 Outline Learning goals Introduction and Motivation Elements of Predicate Logic Translating between English and Predicate

317 views • 29 slides
Predicate Logic: Introduction and Translations Alice Gao Lecture 11 CS 245 Logic and

Predicate Logic: Introduction and Translations Alice Gao Lecture 11 CS 245 Logic and

Predicate Logic: Introduction and Translations Alice Gao Lecture 11 CS 245 Logic and Computation Fall 2019 1 / 37 Outline Learning goals Introduction and Motivation Elements of Predicate Logic Translating between English and Predicate

604 views • 37 slides
Introduction to Symbolic Logic David W. Agler 1 RL: Beyond Predicate Logic Predicate Logic

Introduction to Symbolic Logic David W. Agler 1 RL: Beyond Predicate Logic Predicate Logic

Introduction to Symbolic Logic David W. Agler 1 RL: Beyond Predicate Logic Predicate Logic Semantics with Variable Assignments 2 Predicate Logic Semantics with Variable Assignments Predicate Logic using Names Recall the following valuation

1.51k views • 126 slides
A Gentle Introduction to Mathematical Fuzzy Logic 4. ukasiewicz and GdelDummett logic as

A Gentle Introduction to Mathematical Fuzzy Logic 4. ukasiewicz and GdelDummett logic as

A Gentle Introduction to Mathematical Fuzzy Logic 4. ukasiewicz and GdelDummett logic as logics of continuous t-norms Petr Cintula 1 and Carles Noguera 2 1 Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic 2

915 views • 54 slides
Logic Programming Theory Lecture 3: Definite Clause Predicate Logic Richard Mayr School of

Logic Programming Theory Lecture 3: Definite Clause Predicate Logic Richard Mayr School of

Logic Programming Theory Lecture 3: Definite Clause Predicate Logic Richard Mayr School of Informatics 6th October 2014 Predicate logic / predicate calculus / first-order logic So far, we have looked only at propositional logic , where

852 views • 42 slides
Introduction to Predicate Logic Ling324 Reading: Meaning and Grammar , pg. 113-141 Usefulness of

Introduction to Predicate Logic Ling324 Reading: Meaning and Grammar , pg. 113-141 Usefulness of

Introduction to Predicate Logic Ling324 Reading: Meaning and Grammar , pg. 113-141 Usefulness of Predicate Logic for Natural Language Semantics While in propositional logic, we can only talk about sentences as a whole, predicate logic allows

1.1k views • 27 slides
Todays programme: Predicate Logic Predicate Logic and Program Verification Sten kan ikke

Todays programme: Predicate Logic Predicate Logic and Program Verification Sten kan ikke

Todays programme: Predicate Logic Predicate Logic and Program Verification Sten kan ikke flyve og morlille kan ikke flyve Familiarity with basic concepts/results of predicate logic ergo er morlille en sten! Syntax: variables,

373 views • 14 slides
Complexity of models of fuzzy predicate logics with witnessed semantics Petr H ajek

Complexity of models of fuzzy predicate logics with witnessed semantics Petr H ajek

Complexity of models of fuzzy predicate logics with witnessed semantics Petr H ajek Institute of Computer Science Academy of Sciences 182 07 Prague, Czech Republic hajek@cs.cas.cz 1 The basic fuzzy propositional calculus. The real unit

431 views • 23 slides
On some universal proof system for all versions of many-valued logics Department of Informatics

On some universal proof system for all versions of many-valued logics Department of Informatics

ANAHIT CHUBARYAN, ARTUR KHAMISYAN On some universal proof system for all versions of many-valued logics Department of Informatics and Applied Mathematics Yerevan State University 1 Main notions of k-valued logic. 1 k2 Let E k be the set

459 views • 17 slides
Tautological Necessity and Tautological Validity With Quantifjers Mark Criley IWU 25 October

Tautological Necessity and Tautological Validity With Quantifjers Mark Criley IWU 25 October

Truth Table Necessity We will call the method we use to uncover this form: Boxing, Tagging, and Replacing Truth Table Validity of Arguments What we have to do is fjnd a way of feigning ignorance . We need to make sure that we ignore everything

206 views • 9 slides
Efficient Extraction of Skolem Functions from QRAT Proofs Marijn J.H. Heule Joint work with

Efficient Extraction of Skolem Functions from QRAT Proofs Marijn J.H. Heule Joint work with

Efficient Extraction of Skolem Functions from QRAT Proofs Marijn J.H. Heule Joint work with Martina Seidl and Armin Biere FMCAD, October 23, 2014 1/22 Introduction and Challenges From Clausal Proofs to Skolem Functions Running Example

322 views • 28 slides
Theory of Computer Science B3. Propositional Logic III Gabriele R oger University of Basel

Theory of Computer Science B3. Propositional Logic III Gabriele R oger University of Basel

Theory of Computer Science B3. Propositional Logic III Gabriele R oger University of Basel February 26, 2020 Logical Consequences Inference Resolution Calculus Summary Logical Consequences Logical Consequences Inference Resolution

1.18k views • 78 slides
Logik f ur Informatiker Logic for computer scientists The logic of quantifiers Till

Logik f ur Informatiker Logic for computer scientists The logic of quantifiers Till

Logik f ur Informatiker Logic for computer scientists The logic of quantifiers Till Mossakowski WiSe 2005 2 Logical consequence for quantifiers x ( Cube ( x ) Small ( x )) x Cube ( x ) x Small ( x ) x Cube ( x ) x

640 views • 24 slides
Lecture 7: Ordering variables (minimum remaining value, degree heuristics) Propositional

Lecture 7: Ordering variables (minimum remaining value, degree heuristics) Propositional

CS440/ECE448: Intro to Artificial Intelligence Thursday s key concepts Combining CSP search and inference: Lecture 7: Ordering variables (minimum remaining value, degree heuristics) Propositional logic Ordering values

542 views • 9 slides
PWR Owners Group PWROG Perspective on LBLOCA Rule Change (10 CFR 50.46a) March 24, 2011 Ron

PWR Owners Group PWROG Perspective on LBLOCA Rule Change (10 CFR 50.46a) March 24, 2011 Ron

PWR Owners Group PWROG Perspective on LBLOCA Rule Change (10 CFR 50.46a) March 24, 2011 Ron Jones PWROG Executive Committee 1 PWR Owners Group LBLOCA Rule Change Introduction PWROG supports a rule that meets the objectives stated in

300 views • 6 slides

More recommend