The following pages link to Saeed Salehi (Q590045):
Displaying 50 items.
- Introduction to clarithmetic. II (Q259084) (← links)
- Regular languages of thin trees (Q290908) (← links)
- Introduction to clarithmetic. III (Q392285) (← links)
- Free iterative and iteration \(K\)-semialgebras (Q412016) (← links)
- On equal \(\mu \)-terms (Q549186) (← links)
- Fixing Zeno gaps (Q549197) (← links)
- Varieties of recognizable tree series over fields (Q627171) (← links)
- A sorting network in bounded arithmetic (Q638498) (← links)
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- The word problem for \(\omega \)-terms over DA (Q650888) (← links)
- Cutting planes and the parameter cutwidth (Q693047) (← links)
- On some representations of the real number field (Q695771) (← links)
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem (Q731897) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- (Q812100) (redirect page) (← links)
- Proof analysis in modal logic (Q812101) (← links)
- Towards a semantic characterization of cut-elimination (Q817704) (← links)
- Polynomially bounded recursive realizability (Q817959) (← links)
- Tree algebras and varieties of tree languages (Q884456) (← links)
- On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
- On the form of witness terms (Q982183) (← links)
- Intuitionistic axiomatizations for bounded extension Kripke models. (Q1412839) (← links)
- On fixed points of rational transductions (Q1637233) (← links)
- On constructivity and the Rosser property: a closer look at some Gödelean proofs (Q1653263) (← links)
- On partial disjunction properties of theories containing Peano arithmetic (Q1756504) (← links)
- Kripke semantics for fuzzy logics (Q1797765) (← links)
- Stratified coherence spaces: A denotational semantics for light linear logic (Q1827389) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- First-order continuous induction and a logical study of real closed fields (Q2287034) (← links)
- Generalized realizability for extensions of the language of arithmetic (Q2287392) (← links)
- When is scalar multiplication decidable? (Q2311210) (← links)
- On decidability and axiomatizability of some ordered structures (Q2318170) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- Locality for classical logic (Q2372689) (← links)
- Herbrand consistency of some finite fragments of bounded arithmetical theories (Q2377353) (← links)
- On modal logic of deductive closure (Q2498907) (← links)
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories (Q2566065) (← links)
- Positive varieties of tree languages (Q2576866) (← links)
- Congruence preserving functions of Wilke's tree algebras (Q2577741) (← links)
- From intuitionism to many-valued logics through Kripke models (Q2658284) (← links)
- Separating bounded arithmetical theories by Herbrand consistency (Q2893322) (← links)
- Herbrand consistency of some arithmetical theories (Q2915894) (← links)
- (Q3077328) (← links)
- Gödel–Rosser's Incompleteness Theorem, generalized and optimized for definable theories (Q3133168) (← links)
- ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP (Q3386609) (← links)
- (Q4613588) (← links)
- On Axiomatizability of the Multiplicative Theory of Numbers (Q4643213) (← links)
- (Q4807686) (← links)
- Provably total functions of Basic Arithmetic (Q4808473) (← links)
