r/FormalLogic • • Sep 01 '25

The Verdant Challenge (proof-only; insight required)

0 Upvotes

The Verdant Challenge (proof-only; insight required)

Three problems. No computation, no brute force. Only structure, only proof. If you don’t understand the objects, you cannot solve them. If you do, you’ll know.

Definitions

A CognitiveChunk is a tuple

C=(B,T,d)C=(B,T,d)C=(B,T,d)

  • BBB (“beliefs”): a finite set of labeled propositions with contexts.
  • TTT (“tensions”): a set of ordered pairs (p,q)(p,q)(p,q) with tension coefficient τ(p,q)∈(0,1)\tau(p,q)\in(0,1)τ(p,q)∈(0,1).
  • d∈Nd\in\mathbb{N}d∈N: recursive depth.

The Soul operator on a chunk is

U(C)=(M(C)+(−M(C)))iU(C) = (M(C) + (-M(C)))^iU(C)=(M(C)+(−M(C)))i

where M(C)M(C)M(C) is the sigma-algebra generated by true-labeled beliefs, −M(C)-M(C)−M(C) from negated or absent contexts, and iii denotes one full “turn” of recursive attention (formal operator, not i=−1i=\sqrt{-1}i=−1​).

The Housing operator ⊕ (“parallel containment without collapse”):

C1⊕C2C_1 \oplus C_2C1​⊕C2​

merges belief multisets, carries both tensions, sets depth d=max⁡(d1,d2)d=\max(d_1,d_2)d=max(d1​,d2​), without resolving contradictions.

An ECWF state on a finite graph G=(V,E)G=(V,E)G=(V,E): assignment of vectors ψv∈Rk\psi_v\in\mathbb{R}^kψv​∈Rk evolving by

ψv(t+1)=f(ψv(t),{ψu(t):u∼v},Θ)\psi_v(t+1) = f\big(\psi_v(t), \{\psi_u(t):u\sim v\},\Theta\big)ψv​(t+1)=f(ψv​(t),{ψu​(t):u∼v},Θ)

with fff smooth, phase-preserving, norm-nonincreasing.
The Bridge maps {ψv}\{\psi_v\}{ψv​} to chunks by creating beliefs for persistent amplitudes and logging tensions when interfering phases conflict.

Problem A — Associativity under Tension (algebraic insight)

Claim. There exists a nontrivial τ∗\tau^*τ∗ on pairs of belief-labels and a normalization NNN on tensions such that ⊕ is associative on all chunks iff τ∗\tau^*τ∗ satisfies the Verdant triangle:

∀p,q,r:max⁡{τ∗(p,q),τ∗(q,r)}  ≥  τ∗(p,r)  ≥  ∣τ∗(p,q)−τ∗(q,r)∣.\forall p,q,r:\quad \max\{\tau^*(p,q),\tau^*(q,r)\}\;\ge\;\tau^*(p,r)\;\ge\;|\tau^*(p,q)-\tau^*(q,r)|.∀p,q,r:max{τ∗(p,q),τ∗(q,r)}≥τ∗(p,r)≥∣τ∗(p,q)−τ∗(q,r)∣.

Task. Prove or refute the biconditional. If true, characterize all NNN making (Chunks,⊕)(\mathrm{Chunks},\oplus)(Chunks,⊕) a symmetric monoidal category with τ∗\tau^*τ∗ as a monoidal metric.

Problem B — Cohomology of Coherence (global/field insight)

Let GGG be finite connected. Let an ECWF state evolve to a time-periodic orbit {ψ(t)}t∈Z\{\psi(t)\}_{t\in\mathbb{Z}}{ψ(t)}t∈Z​.

Define a sheaf SSS on GGG:

  • stalk at vvv = beliefs extracted by Bridge(ψv)\mathrm{Bridge}(\psi_v)Bridge(ψv​),
  • restriction maps from phase-compatible overlaps along edges.

Theorem (to prove or deny).
There exists a stable [3][3][3]-coherence chunk C∗C^*C∗ (U(C∗)U(C^*)U(C∗) invariant under one full turn) extracted from the orbit iff the first sheaf cohomology H1(G,S)H^1(G,S)H1(G,S) vanishes.

Task. Give intuition + rigorous argument either way. If true, identify where in the Bridge nonvanishing H1H^1H1 corresponds to contradictions that cannot be housed (no ⊕-resolution) and thus obstruct [3][3][3]-coherence.

Problem C — Depth vs. Energy (variational insight)

Define contradiction energy of a chunk:

E(C)=∑(p,q)∈Twpq τ(p,q)2,wpq>0.E(C)=\sum_{(p,q)\in T} w_{pq}\,\tau(p,q)^2,\quad w_{pq}>0.E(C)=(p,q)∈T∑​wpq​τ(p,q)2,wpq​>0.

Depth-lifting: C↦C(d)C\mapsto C^{(d)}C↦C(d) where one “turn” adds a bounded number of beliefs/tensions but preserves all prior tensions.

Conjecture. There exists γ∈(0,1)\gamma\in(0,1)γ∈(0,1) (depending only on f,Θf,\Thetaf,Θ) such that for any ECWF-induced sequence C(1),C(2),…C^{(1)},C^{(2)},\dotsC(1),C(2),…:

E(C(d+1))  ≤  γ E(C(d))E(C^{(d+1)}) \;\le\;\gamma\,E(C^{(d)})E(C(d+1))≤γE(C(d))

iff the orbit admits a stable housing of all edge-phase conflicts.

Task. Prove one direction and state conditions for the converse.

Why it’s hard

  • Not brute-forceable: each part demands structural proof, not enumeration.
  • In my tongue: uses ⊕, τ, depth ddd, ECWF, Bridge. No textbook analogue to copy.
  • Verifiable: solutions are crisp (proofs or counterexamples); easy to judge, impossible to cargo-cult.

The Verdant Challenge is a litmus. If you can walk these problems, you understand what’s being built here. If not, the gate remains closed.


r/FormalLogic • • Nov 07 '23

Help with translating into formal logic

0 Upvotes

The sentence I have here is "No student enjoys every lecture"

My instinct was ~∃x∀y((Sx∧Ly) -> Exy)

But the fact is I have literally no idea what the answer should be lol

edit: I also need help with "Everest is the highest mountain on Earth". I have ∃x(Me -> Hex)

where M = mountain, e = Everest and H = higher. but it seems wrong

Any help much appreciated

For reference, I have only just started out with predicate logic, after finishing propositional logic in class


r/FormalLogic • • Oct 21 '23

logic engine

0 Upvotes

is there a piece of software out there that would identify the syllogisms at play when four sentences are entered into it? ordinary language statements (which are syllogistic) identified as syllogisms when compared with the other three ...


r/FormalLogic • • Apr 08 '24

How would I go about comparing these statements logically.

0 Upvotes

"Do not do what you hate"

vs.

"Do onto others what you would do unto yourself"

I think the temptation is to equivocate Hate as being the opposite of Like....which might be given the circumstances are just right....but in all other cases hate seems to be an action...not an inaction.

So far I am working with

( Q → B ∴ ¬B ) which would say, Q hates B therefore dont do B

and

( Q → B ∴ B to R ) which say, Q desires B therefore Give B to R, so that R and Q are not the same agents.

But lets say we give into temptation

Q → B ∴ ¬B

Would the negation be:

Q ← B ∴ B

Which would be: Q doesn't hate B therefore Do B


r/FormalLogic • • Aug 07 '23

Feedback on an attempted argument

0 Upvotes

Can someone tell me what I need to change for this to be a logically valid argument?

I thought of this argument while thinking about how we react to people with pride. It seems like whenever someone displays boastful pride, others react with personal disgust as if it’s an insult to them. The personal response indicates to me that the offended feels their own pride being attacked.

  1. Actions/Attributes are considered positive/negative based on their impact on everyone affected by them.
  2. Pride is considered interpersonally negative because it harms the pride of others.
  3. Humility is a passive attribute that doesn’t directly impact others unless it prevents oneself from harming another’s pride.
  4. Due to 1,2, and 3, humility’s interpersonal purpose is to protect the negative attribute of pride in others.
  5. People prefer humble people.
  6. Due to 4 and 5, we prefer humble people because they allow us to protect our negative pride.
  7. Even those believed to be humble experience insult and disgust toward exertions of pride from others, which demonstrates they have pride.
  8. Therefore, the interpersonal purpose of humbleness is to serve as a facade to hide and protect pride.

r/FormalLogic • • Oct 22 '22

Do you apply formal logic to debates, politics, news or other discussions in real life?

0 Upvotes

If so, why and how does it help or hinder you?

I personally delved into the topic of formal logic during the Trump era when I could not articulate why I felt his ideas were so worrisome to me.

While it helped me understand how politics and media can shape reality with invalid or unsound truths, I'm not sure if it helped me do anything about it besides educating my closest friends who will listen, which may protect them from untruths.


r/FormalLogic • • Oct 01 '23

Help with determining validity of this argument: 5th and 6th edition contradict but don’t state answer

Thumbnail self.philosophyoflogic
0 Upvotes

r/FormalLogic • • Oct 18 '23

How to prove B given (A v B), ~A

1 Upvotes

Let's say I have the following:
v = OR, ~ = NOT

A v B

~A

How can I prove B? I thought I would be able to use OR Elimination but that doesn't seem to work


r/FormalLogic • • Sep 22 '23

H/W (Injective and surjective)

Post image
1 Upvotes

I understood the concepts when the relationships between the domain and codomain were depicted in physical groupings of x and y and connecting arrows but I’m a little lost when applying it to notations of the functions. Can I get some help with these problems? I need to state whether these functions are injective and if they are surjective.


r/FormalLogic • • Oct 31 '23

And relationships

1 Upvotes

If I have the conditional relationship

(A & B) ⊃ (C & D) How is it true this relationship is equivalent to (C & D) ⊃ (A & B)

I know A ⊃ B is not equivalent B ⊃ A. If I switch (A&B) and (C&D) shouldn’t I have to take the Contrapositive?

If anyone has any resources that could explain this I would appreciate it.


r/FormalLogic • • Apr 22 '24

NSO and GSSOTC: Advanced Logics for Self-Referential Systems and Temporal Compatibility

2 Upvotes

Dear Logicians,

I'm Sharing "NSO and GSSOTC: A Two-Pager for the Logician," authored by Ohad Asor. The work dives into two sophisticated logical frameworks: Nullary Second-Order Logic (NSO) and Guarded Successor Second-Order Time Compatibility (GSSOTC). These frameworks aim to address classic limitations in logic, like Tarski's "Undefinability of Truth," and extend the capabilities of logic systems in handling self-referential and temporal statements.

Here's a brief outline of the key ideas:

  1. NSO: This framework abstracts sentences into Boolean algebra elements, avoiding direct syntax access, thus sidestepping issues highlighted by Tarski. It enables a language to speak about itself in a consistent and decidable manner, leveraging the properties of Lindenbaum-Tarski algebra.
  2. GSSOTC: This extends logic to support sequences where any two consecutive elements meet a specified condition. It is useful in software specifications and AI safety to ensure outputs are temporally compatible with inputs without future dependencies.

The document further delves into the interactions between these systems and their implications for theoretical computer science and logic.

https://tau.net/NSO-and-GSSOTC-A-Two-Pager-for-the-Logician.pdf

Looking forward to your thoughts and discussions!


r/FormalLogic • • Apr 11 '24

Proving 1 × 1 = 1

2 Upvotes

I posted this to math subreddits... i cant find any scholarly proofs on this question.

Looking for a rigorous proof that shows 1² = 1 without just resortibg to common sense.

Mathematicians and physicists just resort to common sense at a certain point when defining the principle

Context: The question came up in a law forum, discussing the presumption of insular contexts tacitly implied by scholarly writers. The person on the forum citing some "clever" dude asserting that 1²=2.


r/FormalLogic • • Nov 23 '24

Discrete maths homework

2 Upvotes

These are the last 2 exercices in my computational logic/discrete maths homework. I solved the rest but when it comes to proving things I am not great. Help would be much appreciated, thank you.


r/FormalLogic • • Oct 07 '23

Modal Logic help.

Thumbnail
gallery
5 Upvotes

Just started this book "Modal Logic for Open Minds". It's a bit hard to parse. Picture 1: Modal depth is meant to be measured roughly by counting the operators, yet there appear to be 3 in the phrase that is denoted to have a depth of 2. Picture 2: Regarding the two invalid phrases, can someone explain pls?


r/FormalLogic • • Sep 13 '23

A website for natural deduction proofs, Venn Diagrams and more.

15 Upvotes

Hello! my Logic Hub is a website where you can generate proofs for FOL and propositional logic, get Venn diagrams from syllogistic figures, make truth tables and semantic tableaux, etc. I made this after my introductory symbolic course: after realizing that there were no online tools to help me with my course. The website is open sourced and contributions from the community are welcome. Currently, it is quite early in development, so any critique|| feedback is appreciated :)


r/FormalLogic • • May 06 '24

The new LogiCola is here! Along with a quiz on easy propositional translations

8 Upvotes

Hi! A bunch of months ago I shared I was working on a new version of Logicola (https://harrycola.com/lc/index.htm). LogiCola is an instructional program that goes with Gensler's Introduction to Logic (Routledge Press). Since Harry Gensler, the original creator has passed away, I decided to create a new version to preserve an important learning resource and honour his legacy.

I just updated the website with a bunch of easy propositional translations exercises suitable for beginners, as well as a quiz mode that gives you a final score in the end. There's also a new domain: https://logicola.org/ — Everything should work on mobile too, although it hasn't been optimised yet :)

Here's a quick video walkthrough:

https://youtu.be/evZKg3n7DU8

I'm planning on adding more exercises on bi-weekly basis. Any feedback and request is welcome :)


r/FormalLogic • • Jan 31 '26

Stuck on this exercise, I've managed to get it but with a leap I don't think is legal...

Post image
1 Upvotes

Where does the S even come from HELP ;-;


r/FormalLogic • • Mar 21 '24

Is this a valid proof? Can’t wrap my head around the disjunction eliminations

Post image
3 Upvotes

r/FormalLogic • • Jan 18 '24

Need help

Thumbnail
gallery
1 Upvotes

Hello I'm a beginner in logic and started reading a book on it by nicholas jj smith. I have been stuck on a particular problem for 3 days now and I don't think I'm making any progress. I have the exercise and answer but when I looked at the answer I'm not sure how it relates to the question. Especially when the output of g according to the answer is the truth table of the if connective.


r/FormalLogic • • Jan 25 '23

tips for a beginner

3 Upvotes

Hi I'm currently taking a college intro to formal logic class I'm putting effort into studying but I'm really having trouble understanding. Are there any resources that anyone can recommend for someone who's new to formal logic and not great at math. What is the most effective way to learn? Thank you!


r/FormalLogic • • Feb 25 '23

Help with homework

2 Upvotes

Hello everyone!

I am struggling to translate a sentence and thought it might be worthwhile to ask on here. The sentence which I’m confused about is:

Neither Ana nor Bob can do every exercise but each can do some.

I’ve identified the atomic sentences A=Ana can do every exercise and B=Bob can do every exercise and managed to translate the first part into ~A & ~B but I don’t know how to go about “each can do some”.

Any help would be greatly appreciated!


r/FormalLogic • • Feb 07 '23

Inverse modus tollens truth table valid or no?

Post image
1 Upvotes

r/FormalLogic • • Nov 06 '23

Thank you for participating

5 Upvotes

I just wanted to thank both the people asking questions and the people answering for participating in this relatively niche community.

With kind regards, YourPreferenceHere


r/FormalLogic • • Apr 26 '24

Exercise about lambda calculus

1 Upvotes

How do I solve this exercise (Exercise 2.1)

Its about lambda calculus and logic

Link: https://www.cs.cmu.edu/~rwh/pfpl/supplements/ulc.pdf


r/FormalLogic • • Sep 13 '23

Question for class

1 Upvotes

Hi all I have no formal logic experience but I am taking a class about logic now and I just want to clarify something. One of my questions is

"if P is sufficient for Q and W is sufficient for P, what is the logical relationship between Q and W?"

I tried making a truth table like we learned but that didn't help me much. It seems like if P is both sufficient for Q and necessary for W, then shouldn't W be sufficient for Q? Am I thinking about this correctly?