Predicates & Quantifiers
CMSC 56 | Discrete Mathematical Structure for Computer Science
September 1, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
Predicates & Quantifiers
CMSC 56 | Discrete Mathematical Structure for Computer Science
September 1, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics and computer science. It is a very good tool for improving reasoning and problem-solving capabilities.
Internet of Things (IoT) two-factor authentication using blockchainDavid Wood
Presented at the Ethereum Engineering Group Meetup in Brisbane, Australia, on 13 Nov 2019. We report on research to use an Ethereum blockchain as an MFA and/or MPA device to secure command channels on IoT networks, even when the underlying network may be compromised.
Methods for Securing Spacecraft Tasking and Control via an Enterprise Ethereu...David Wood
Presentation at ICSSC 2019 (see http://www.kaconf.org) associated with the following academic paper:
David Hyland-Wood, Peter Robinson, Roberto Saltini, Sandra Johnson, Christopher Hare. Method for Securing Spacecraft Tasking and Control via an Enterprise Ethereum Blockchain. Proc. 37th International Communications Satellite Systems Conference (ICSSC), 29 October - 1 November 2019.
Implementing the Verifiable Claims data modelDavid Wood
The W3C Verifiable Claims data model arguably requires a decentralised, distributed database controllable by three types of parties; issuers, inspectors, and holders. This presentation explores the benefits of implementing the Verifiable Claims data model using the RDF and Linked Data technology stack.
Metaphors define civilized life. They are all around us in the stories that we teach our children and tell each other to justify our actions. But social metaphors have a dark side. They can cause entire civilizations to self destruct. Metaphors can kill. This presentation explores the power, and danger, of metaphors as social memes.
These slides are from a talk given to the Fredericksburg Secular Humanists (FSH) in Fredericksburg, Virginia, on 8 November 2015. FSH is sub-chapter of the United Coalition of Reason (unitedcor.org). The talk compared the secular societies of the United States and Australia.
Building a writer's platform with social mediaDavid Wood
This presentation reports on my progress in trying to build my writer's platform using social media. It focuses on Twitter, but the advice is generally applicable. Kudos to my mentors @DanCitizen and @RayneHall.
A summary of the Hero's Journey, Joseph Campbell's formulation of the "monomyth" in mythology and literature. Originally presented to the Fredericksburg Writing as a Business Meetup, 24 January 2015.
Open Data is the idea that "certain data should be freely available to everyone to use and republish as they wish, without restrictions from copyright, patents or other mechanisms of control”. Open Data follows similar “open” concepts that have proven to be valuable in the information economy such as Open Standards, Open Source Software, Open Content and has been followed more recently by variations on the theme such as Open Science and Open Government.
Open Data allows information of common value to be reused without needing to be recreated. The economic benefits of Open Data include cost reduction, organizational efficiencies and the facilitation of commonly held understanding. The costs of implementing Open Data deployment strategies tend to be iterative on top of existing information infrastructure.
This presentation will describe Open Data and its place in the ecosystem of economic and governmental discourse.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
The Metaverse and AI: how can decision-makers harness the Metaverse for their...Jen Stirrup
The Metaverse is popularized in science fiction, and now it is becoming closer to being a part of our daily lives through the use of social media and shopping companies. How can businesses survive in a world where Artificial Intelligence is becoming the present as well as the future of technology, and how does the Metaverse fit into business strategy when futurist ideas are developing into reality at accelerated rates? How do we do this when our data isn't up to scratch? How can we move towards success with our data so we are set up for the Metaverse when it arrives?
How can you help your company evolve, adapt, and succeed using Artificial Intelligence and the Metaverse to stay ahead of the competition? What are the potential issues, complications, and benefits that these technologies could bring to us and our organizations? In this session, Jen Stirrup will explain how to start thinking about these technologies as an organisation.
2. Variables and Statements
● Variables in Logic
● A variable is a symbol that stands for an individual in a collection
or set. For example, the variable x may stand for one of the days.
We may let x = Monday or x = Tuesday, etc.
● Incomplete Statements
● A sentence containing a variable is called an incomplete statement.
An incomplete statement is about the individuals in a definite
domain or set. When we replace the variable by the name of an
individual in the set we obtain a statement about that individual.
■ Example of an incomplete statement : “x has 30 days.”
● Here, x can be any month and substituting that, we will get a
complete statement.
Section 1.3 Quantifiers, Predicates and Validity 1
3. Quantifiers and Predicates
● Quantifiers:
● Quantifiers are phrases that refer to given quantities, such as
“for some” or “for all” or “for every,” indicating how many
objects have a certain property.
● Two kinds of quantifiers: Universal and Existential
● Universal Quantifier: represented by ∀
● The symbol is translated as and means “for all”, “given any”,
“for each,” or “for every,” and is known as the universal
quantifier.
● Existential Quantifier: represented by ∃
● The symbol is translated as and means variously “for some,”
“there exists,” “there is a,” or “for at least one”.
Section 1.3 Quantifiers, Predicates and Validity 2
4. Quantifiers and Predicates
● Predicate
● It is the verbal statement that describes the property of a
variable. Usually represented by the letter P, the notation P(x) is
used to represent some unspecified property or predicate that x
may have
■ e.g. P(x) = x has 30 days.
■ P(April) = April has 30 days.
● Combining the quantifier and the predicate, we get a complete
statement of the form ∀(x)P(x) or ∃(x)P(x).
● The collection of objects that satisfy the property P(x) is called
the domain of interpretation.
● Truth value of expressions formed using quantifiers and
predicates
■ What is the truth value of ∀(x)P(x) where x is all the months and
P(x) = x has less than 32 days.
■ Undoubtedly, the above is true since no month has 32 days.
Section 1.3 Quantifiers, Predicates and Validity 3
5. Truth value of the following expressions
● Truth of expression ∀(x)P(x)
1. P(x) is the property that x is yellow, and the domain of
interpretation is the collection of all flowers:
not true
2. P(x) is the property that x is a plant, and the domain of
interpretation is the collection of all flowers:
true
3. P(x) is the property that x is positive, and the domain of
interpretation consists of integers:
not true
■ Can you find one interpretation in which both ∀(x)P(x) is true and
∃(x)P(x) is false?
Not possible
■ Can you find one interpretation in which both ∃(x)P(x) is true and
∀(x)P(x) is false?
Case 1 as mentioned above
● Predicates involving properties of single variables : unary
predicates
● Binary, ternary and n-ary predicates are also possible.
■ (∀x) (∃y)Q(x,y) is a binary predicate. This expression reads as
“for every x there exists a y such that Q(x,y).”
Section 1.3 Quantifiers, Predicates and Validity 4
6. Interpretation
● Formal definition: An interpretation for an expression involving
predicates consists of the following:
A collection of objects, called the domain of interpretation,
which must include at least one object.
An assignment of a property of the objects in the domain to each
predicate in the expression.
An assignment of a particular object in the domain to each
constant symbol in the expression.
● Predicate wffs can be built similar to propositional wffs using
logical connectives with predicates and quantifiers.
● Examples of predicate wffs
■ (∀x)[P(x) → Q(x)]
■ (∀x) ((∃y)[P(x,y) V Q(x,y)] → R(x))
■ S(x,y) Λ R(x,y)
Section 1.3 Quantifiers, Predicates and Validity 5
7. Scope of a variable in an expression
● Brackets are used wisely to identify the scope of the variable.
■ (∀x) [∃(y)[P(x,y) V Q(x,y)] → R(x)]
■ Scope of (∃y) is P(x,y) V Q(x,y) while the scope of (∀x) is the entire
expression.
■ (∀x)S(x) V (∃y)R(y)
■ Scope of x is S(x) while the scope of y is R(y).
■ (∀x)[P(x,y) → (∃y) Q(x,y)]
■ Scope of variable y is not defined for P(x,y) hence y is called a free
variable. Such expressions might not have a truth value at all.
● What is the truth of the expression
■ ∃(x)[A(x) Λ ∀(y)[B(x,y) → C(y)]] in the interpretation
■ A(x) is “x > 0” , B(x, y) is “x > y” and C(y) is “y ≤ 0” where the
domain of x is positive integers and the domain of y is all integers
True, x=1 is a positive integer and any integer less than x is ≤ 0
Section 1.3 Quantifiers, Predicates and Validity 6
8. Translation: Verbal statements to symbolic form
● “Every person is nice” can be rephrased as “For any thing, if it
is a person, then it is nice.” So, if P(x) is “x is a person” and Q
(x) be “x is nice,” the statement can be symbolized as
■ (∀x)[P(x) → Q(x)]
■ “All persons are nice” or “Each person is nice” will also have the
same symbolic form.
● “There is a nice person” can be rewritten as “There exists
something that is both a person and nice.”
■ In symbolic form, (∃x)[P(x) Λ Q(x)].
■ Variations: “Some persons are nice” or “There are nice persons.”
● What would the following form mean for the example above?
(∃x)[P(x) → Q(x)]
■ This will only be true if there are no persons in the world but that
is not the case.
■ Hence such a statement is false, so almost always, ∃ goes with Λ
(conjunction) and ∀ goes with → (implication).
Section 1.3 Quantifiers, Predicates and Validity 7
9. Translation
● Hint: Avoid confusion by framing the statement in different forms as
possible.
● The word “only” can be tricky depending on its presence in the
statement.
■ X loves only Y ⇔ If X loves anything, then that thing is Y.
■ Only X loves Y ⇔ If anything loves Y, then it is X.
■ X only loves Y ⇔ If X does anything to Y, then it is love.
● Example for forming symbolic forms from predicate symbols
■ D(x) is “x is dog”; R(x) is “x is a rabbit”; C(x,y) is “x chases y”
■ All dogs chase all rabbits ⇔ For anything, if it is a dog, then for any
other thing, if it is a rabbit, then the dog chases it ⇔ (∀x)[D(x) → (∀y)(R
(y) → C(x,y)]
■ Some dogs chase all rabbits ⇔ There is something that is a dog and for
any other thing, if that thing is a rabbit, then the dog chases it ⇔ (∃x)[D
(x) Λ (∀y)(R(y) → C(x,y)]
■ Only dogs chase rabbits ⇔ For any two things, if one is a rabbit and the
other chases it, then the other is a dog ⇔ (∀y) (∀x)[R(y) Λ C(x,y) → D
(x)]
Section 1.3 Quantifiers, Predicates and Validity 8
10. Negation of statements
● A(x): Everything is fun
● Negation will be “it is false that everything is fun,” i.e. “something
is nonfun.”
● In symbolic form, [(∀x)A(x)]ʹ′ ⇔ (∃x)[A(x)]ʹ′
● Similarly negation of “Something is fun” is “Nothing is fun” or
“Everything is boring.”
● Hence, [(∃x)A(x)]ʹ′ ⇔ (∀x)[A(x)]ʹ′
Section 1.3 Quantifiers, Predicates and Validity 9
11. Class Exercise
● What is the negation of “Everybody loves somebody sometime.”
■ Everybody hates somebody sometime
■ Somebody loves everybody all the time
■ Everybody hates everybody all the time
■ Somebody hates everybody all the time
√
● What is the negation of the following statements?
● Some pictures are old and faded.
Every picture is neither old nor faded.
● All people are tall and thin.
Someone is short or fat.
● Some students eat only pizza.
Every student eats something that is not pizza.
● Only students eat pizza.
There is a non-student who eats pizza.
Section 1.3 Quantifiers, Predicates and Validity 10
12. Class exercise
● S(x): x is a student; I(x): x is intelligent; M(x): x likes music
● Write wffs that express the following statements:
■ All students are intelligent.
For anything, if it is a student, then it is intelligent ⇔
(∀x)[S(x) → I (x)]
■ Some intelligent students like music.
There is something that is intelligent and it is a student and it likes music ⇔
(∃x)[I(x) Λ S(x) Λ M(x)]
■ Everyone who likes music is a stupid student.
For anything, if that thing likes music, then it is a student and it is not intelligent ⇔
(∀x)(M(x) → S(x) Λ [I (x)]ʹ′)
■ Only intelligent students like music.
For any thing, if it likes music, then it is a student and it is intelligent ⇔
(∀x)(M(x) → S(x) Λ I(x))
Section 1.3 Quantifiers, Predicates and Validity 11
13. Validity
● Analogous to a tautology of propositional logic.
● Truth of a predicate wff depends on the interpretation.
● A predicate wff is valid if it is true in all possible interpretations
just like a propositional wff is true if it is true for all rows of the
truth table.
● A valid predicate wff is intrinsically true.
Propositional Wffs
Predicate Wffs
Truth values
True or false – depends on True, false or neither (if the
the truth value of statement wff has a free variable)
letters
Intrinsic truth
Tautology – true for all truth Valid wff – true for all
values of its statements
interpretations
Methodology
Truth table to determine if it No algorithm to determine
is a tautology
validity
Section 1.3 Quantifiers, Predicates and Validity 12
14. Validity examples
● (∀x)P(x) → (∃x)P(x)
■ This is valid because if every object of the domain has a certain
property, then there exists an object of the domain that has the
same property.
● (∀x)P(x) → P(a)
■ Valid – quite obvious since is a member of the domain of x.
● (∃x)P(x) → (∀x)P(x)
■ Not valid since the property cannot be valid for all objects in the
domain if it is valid for some objects of than domain. Can use a
mathematical context to check as well.
■ Say P(x) = “x is even,” then there exists an integer that is even but
not every integer is even.
● (∀x)[P(x) V Q(x)] → (∀x)P(x) V (∀x)Q(x)
■ Invalid, can prove by mathematical context by taking P(x) = x is
even and Q(x) = x is odd.
■ In that case, the hypothesis is true but the conclusion is false
because it is not the case that every integer is even or that every
integer is odd.
Section 1.3 Quantifiers, Predicates and Validity 13
15. Class Exercise
● What is the truth of the following wffs where the domain consists
of integers:
● (∀x)[L(x) → O(x)] where O(x) is “x is odd” and L(x) is “x < 10”?
● (∃y)(∀x)(x + y = 0)?
● (∃y)(∃x)(x2 = y)?
● (∀x)[x < 0 → (∃y)(y > 0 Λ x + y = 0)]?
● Using predicate symbols and appropriate quantifiers, write the
symbolic form of the following English statement:
● D(x) is “x is a day”
M is “Monday”
T is “Tuesday”
● S(x) is “x is sunny”
R(x) is “x is rainy”
● Some days are sunny and rainy.
● It is always a sunny day only if it is a rainy day.
● It rained both Monday and Tuesday.
● Every day that is rainy is not sunny.
Section 1.3 Quantifiers, Predicates and Validity 14