Skip to main content
emesupap's user avatar
emesupap's user avatar
emesupap's user avatar
emesupap
  • Member for 2 years, 3 months
  • Last seen this week
4 votes

Interpreting truth functions in Shoenfield

4 votes

First order logic model: why not an ordered triplet?

3 votes
Accepted

Are there only three types of statements?

3 votes
Accepted

Un-definability of graphs with bounded out-degree

3 votes
Accepted

Why contraction mapping must require $f: ~A\to A$?

2 votes

Understanding the Definition by Recursion theorem

2 votes
Accepted

Strong homomorphisms of partial orders

2 votes
Accepted

What can domain of discourse contain in FOL?

2 votes

Understanding the proof of the uncomputability of the "productivity function"

1 vote
Accepted

In what way is every function in $\aleph_0$ given by a family of coprojections?

1 vote

Michell FPL 2.3.5 (observable types)

1 vote

How to show if $\Gamma\models\bot$, then $\Gamma$ is not satisfiable?

1 vote

Introductory text on logic for those interested in the intersection of logic, algebra, and topology?

1 vote

How is vector addition of x + y = xy and scalar multiplication kx=x^k?

1 vote
Accepted

Continuity of the fibre product projection

1 vote

Using logical equivalences to show $(A \Delta B) \cap C = (A \cap C) \Delta (B \cap C)$

1 vote

Confusion about equality: mathematical objects versus the symbols that describe them

1 vote

Truth sets in mathematics

1 vote

Function that can be computed by two distinct Turing machines

1 vote

Is there some variant of sequent calculus that allows for non-trivial axioms?

1 vote
Accepted

Solution Verification: Prove or Disprove: If $L$ is an irregular language and $F$ is finite language, then $F\cap L^+$ is regular.

1 vote

Probability a sleep kitten can escape falling into a ball pit

0 votes

Formal Proof of Turing Machine

0 votes
Accepted

Logical Argumentation of $[(\phi \lor \psi) \implies \theta] \iff [(\phi \implies \theta) \wedge (\psi \implies \theta)]$

0 votes

Formulation of the Successor Function as an Endofunction in First-Order Logic

0 votes

Is there a theorem that can easily be proved to be non intuitionistic?

0 votes

Leinster's proof of "Representables preserve limits"

0 votes

Analytic function in the closed unit disc